id stringlengths 9 16 | title stringlengths 4 278 | categories listlengths 1 13 | abstract stringlengths 3 4.08k | filtered_category_membership dict |
|---|---|---|---|---|
0802.2385 | Essential variables and positions in terms | [
"math.GM",
"cs.IT",
"math.IT"
] | The paper deals with $\Sigma-$composition of terms, which allows us to extend the derivation rules in formal deduction of identities. The concept of essential variables and essential positions of terms with respect to a set of identities is a key step in the simplification of the process of formal deduction. $\Sigma-... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2411 | Multiclass Approaches for Support Vector Machine Based Land Cover
Classification | [
"cs.NE",
"cs.CV"
] | SVMs were initially developed to perform binary classification; though, applications of binary classification are very limited. Most of the practical applications involve multiclass classification, especially in remote sensing land cover classification. A number of methods have been proposed to implement SVMs to produc... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 1,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 1,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2428 | Sign Language Tutoring Tool | [
"cs.LG",
"cs.HC"
] | In this project, we have developed a sign language tutor that lets users learn isolated signs by watching recorded videos and by trying the same signs. The system records the user's video and analyses it. If the sign is recognized, both verbal and animated feedback is given to the user. The system is able to recognize ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 1,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 1,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2429 | Anisotropic selection in cellular genetic algorithms | [
"cs.AI"
] | In this paper we introduce a new selection scheme in cellular genetic algorithms (cGAs). Anisotropic Selection (AS) promotes diversity and allows accurate control of the selective pressure. First we compare this new scheme with the classical rectangular grid shapes solution according to the selective pressure: we can o... | {
"Other": 0,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2451 | Capacity of General Discrete Noiseless Channels | [
"cs.IT",
"math.IT"
] | This paper concerns the capacity of the discrete noiseless channel introduced by Shannon. A sufficient condition is given for the capacity to be well-defined. For a general discrete noiseless channel allowing non-integer valued symbol weights, it is shown that the capacity--if well-defined--can be determined from the r... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2476 | Theoretical Analysis of the Energy Capture in Strictly Bandlimited
Ultra-Wideband Channels | [
"cs.IT",
"math.IT"
] | The frequency selectivity of wireless communication channels can be characterized by the delay spread Ds of the channel impulse response. If the delay spread is small compared to the bandwidth W of the input signal, that is, Ds*W approximately equal to 1, the channel appears to be flat fading. For Ds*W >> 1, the channe... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2574 | The minimal set of Ingleton inequalities | [
"cs.IT",
"math.IT"
] | The Ingleton-LP bound is an outer bound for the multicast capacity region, assuming the use of linear network codes. Computation of the bound is performed on a polyhedral cone obtained by taking the intersection of half-spaces induced by the basic (Shannon-type) inequalities and Ingleton inequalities. This paper simpli... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2587 | Order-Optimal Consensus through Randomized Path Averaging | [
"cs.IT",
"cs.NI",
"math.IT",
"math.PR"
] | Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over networks. However for many topologies that are realistic for wireless ad-hoc and sensor networks (like grids and random geometric graphs), ... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2655 | Pure Exploration for Multi-Armed Bandit Problems | [
"math.ST",
"cs.LG",
"stat.TH"
] | We consider the framework of stochastic multi-armed bandit problems and study the possibilities and limitations of forecasters that perform an on-line exploration of the arms. These forecasters are assessed in terms of their simple regret, a regret notion that captures the fact that exploration is only constrained by t... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 1,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2666 | Distributed Joint Source-Channel Coding for arbitrary memoryless
correlated sources and Source coding for Markov correlated sources using LDPC
codes | [
"cs.IT",
"math.IT"
] | In this paper, we give a distributed joint source channel coding scheme for arbitrary correlated sources for arbitrary point in the Slepian-Wolf rate region, and arbitrary link capacities using LDPC codes. We consider the Slepian-Wolf setting of two sources and one destination, with one of the sources derived from the ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2684 | A Simple Distributed Antenna Processing Scheme for Cooperative Diversity | [
"cs.IT",
"math.IT"
] | In this letter the performance of multiple relay channels is analyzed for the situation in which multiple antennas are deployed only at the relays. The simple repetition-coded decodeand- forward protocol with two different antenna processing techniques at the relays is investigated. The antenna combining techniques are... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2701 | Authentication over Noisy Channels | [
"cs.IT",
"cs.CR",
"math.IT"
] | In this work, message authentication over noisy channels is studied. The model developed in this paper is the authentication theory counterpart of Wyner's wiretap channel model. Two types of opponent attacks, namely impersonation attacks and substitution attacks, are investigated for both single message and multiple me... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 1,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2703 | Optimal Medium Access Protocols for Cognitive Radio Networks | [
"cs.IT",
"cs.NI",
"math.IT"
] | This paper focuses on the design of medium access control protocols for cognitive radio networks. The scenario in which a single cognitive user wishes to opportunistically exploit the availability of empty frequency bands within parts of the radio spectrum having multiple bands is first considered. In this scenario, th... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2723 | On strongly controllable group codes and mixing group shifts: solvable
groups, translation nets, and algorithms | [
"cs.IT",
"math.IT"
] | The branch group of a strongly controllable group code is a shift group. We show that a shift group can be characterized in a very simple way. In addition it is shown that if a strongly controllable group code is labeled with Latin squares, a strongly controllable Latin group code, then the shift group is solvable. Mor... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2773 | Stiffness Analysis of 3-d.o.f. Overconstrained Translational Parallel
Manipulators | [
"cs.RO",
"physics.class-ph"
] | The paper presents a new stiffness modelling method for overconstrained parallel manipulators, which is applied to 3-d.o.f. translational mechanisms. It is based on a multidimensional lumped-parameter model that replaces the link flexibility by localized 6-d.o.f. virtual springs. In contrast to other works, the method ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 1,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2823 | On the decomposition of k-valued rational relations | [
"cs.IT",
"math.IT"
] | We give a new, and hopefully more easily understandable, structural proof of the decomposition of a $k$-valued transducer into $k$ unambiguous functional ones, a result established by A. Weber in 1996. Our construction is based on a lexicographic ordering of computations of automata and on two coverings that can be bui... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2826 | Efficient Minimization of DFAs with Partial Transition Functions | [
"cs.IT",
"cs.DS",
"math.IT"
] | Let PT-DFA mean a deterministic finite automaton whose transition relation is a partial function. We present an algorithm for minimizing a PT-DFA in $O(m \lg n)$ time and $O(m+n+\alpha)$ memory, where $n$ is the number of states, $m$ is the number of defined transitions, and $\alpha$ is the size of the alphabet. Time c... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2839 | On Termination for Faulty Channel Machines | [
"cs.IT",
"cs.CC",
"math.IT"
] | A channel machine consists of a finite controller together with several fifo channels; the controller can read messages from the head of a channel and write messages to the tail of a channel. In this paper, we focus on channel machines with insertion errors, i.e., machines in whose channels messages can spontaneously a... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2842 | Weak index versus Borel rank | [
"cs.IT",
"math.IT"
] | We investigate weak recognizability of deterministic languages of infinite trees. We prove that for deterministic languages the Borel hierarchy and the weak index hierarchy coincide. Furthermore, we propose a procedure computing for a deterministic automaton an equivalent minimal index weak automaton with a quadratic n... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2844 | Analytic aspects of the shuffle product | [
"cs.IT",
"math.CO",
"math.IT"
] | There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the search to understand how to extend these natural correspondences, we find that the shuffle product models many key aspects of D-finite generating... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2856 | Convergence Thresholds of Newton's Method for Monotone Polynomial
Equations | [
"cs.DS",
"cs.IT",
"cs.NA",
"math.IT"
] | Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations $X_1 = f_1(X_1, ..., X_n),$ $..., X_n = f_n(X_1, ..., X_n)$ where each $f_i$ is a polynomial with positive real coefficients. The question of computing the least non-negative solution of a given MSPE $\vec X = \vec f(\vec X)$ arises n... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.2975 | Hard Fairness Versus Proportional Fairness in Wireless Communications:
The Multiple-Cell Case | [
"cs.IT",
"math.IT"
] | We consider the uplink of a cellular communication system with $K$ users per cell and infinite base stations equally spaced on a line. The system is conventional, i.e., it does not make use of joint cell-site processing. A hard fairness (HF) system serves all users with the same rate in any channel state. In contrast, ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3110 | An entropic view of Pickands' theorem | [
"cs.IT",
"math.IT"
] | It is shown that distributions arising in Renyi-Tsallis maximum entropy setting are related to the Generalized Pareto Distributions (GPD) that are widely used for modeling the tails of distributions. The relevance of such modelization, as well as the ubiquity of GPD in practical situations follows from Balkema-De Haan-... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3137 | Design and Implementation of Aggregate Functions in the DLV System | [
"cs.AI",
"cs.LO"
] | Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows for expressing every property of finite structures that is decidable in the complexity class SigmaP2 (= NP^NP). Despite this high expressiveness, there are some simple properties, often arising in real-world applications, which cannot be enco... | {
"Other": 1,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3235 | Characterization of the convergence of stationary Fokker-Planck learning | [
"cs.NE",
"cond-mat.dis-nn",
"cs.AI"
] | The convergence properties of the stationary Fokker-Planck algorithm for the estimation of the asymptotic density of stochastic search processes is studied. Theoretical and empirical arguments for the characterization of convergence of the estimation in the case of separable and nonseparable nonlinear optimization prob... | {
"Other": 0,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 1,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3253 | On the Capacity and Design of Limited Feedback Multiuser MIMO Uplinks | [
"cs.IT",
"cs.MM",
"math.IT"
] | The theory of multiple-input multiple-output (MIMO) technology has been well-developed to increase fading channel capacity over single-input single-output (SISO) systems. This capacity gain can often be leveraged by utilizing channel state information at the transmitter and the receiver. Users make use of this channel ... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3285 | Some Aspects of Testing Process for Transport Streams in Digital Video
Broadcasting | [
"cs.CV",
"cs.MM"
] | This paper presents some aspects related to the DVB (Digital Video Broadcasting) investigation. The basic aspects of DVB are presented, with an emphasis on DVB-T version of standard. The main purpose of this research is to analyze the way that the transmission of the transport streams is realized in case of the Terrest... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 1,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3288 | Implementing a Test Strategy for an Advanced Video Acquisition and
Processing Architecture | [
"cs.CV",
"cs.MM"
] | This paper presents some aspects related to test process of an advanced video system used in remote IP surveillance. The system is based on a Pentium compatible architecture using the industrial standard PC104+. First the overall architecture of the system is presented, involving both hardware or software aspects. The ... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 1,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3293 | Use of Rapid Probabilistic Argumentation for Ranking on Large Complex
Networks | [
"cs.AI",
"cs.IR"
] | We introduce a family of novel ranking algorithms called ERank which run in linear/near linear time and build on explicitly modeling a network as uncertain evidence. The model uses Probabilistic Argumentation Systems (PAS) which are a combination of probability theory and propositional logic, and also a special case of... | {
"Other": 0,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 1,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3401 | On the Structure of the Capacity Region of Asynchronous Memoryless
Multiple-Access Channels | [
"cs.IT",
"math.IT"
] | The asynchronous capacity region of memoryless multiple-access channels is the union of certain polytopes. It is well-known that vertices of such polytopes may be approached via a technique called successive decoding. It is also known that an extension of successive decoding applies to the dominant face of such polytop... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3414 | A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped
Robots in a Quadratic Number of Moves | [
"cs.CG",
"cs.MA",
"cs.RO"
] | In the modular robot reconfiguration problem, we are given $n$ cube-shaped modules (or robots) as well as two configurations, i.e., placements of the $n$ modules so that their union is face-connected. The goal is to find a sequence of moves that reconfigures the modules from one configuration to the other using "slidin... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 1,
"cs.NE": 0,
"cs.RO": 1,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3419 | Randomized Frameproof Codes: Fingerprinting Plus Validation Minus
Tracing | [
"cs.IT",
"cs.CR",
"math.IT"
] | We propose randomized frameproof codes for content protection, which arise by studying a variation of the Boneh-Shaw fingerprinting problem. In the modified system, whenever a user tries to access his fingerprinted copy, the fingerprint is submitted to a validation algorithm to verify that it is indeed permissible befo... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 1,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3429 | Quasi-Large Sparse-Sequence CDMA: Approach to Single-User Bound by
Linearly-Complex LAS Detectors | [
"cs.IT",
"math.IT"
] | We have proposed a quasi-large random-sequence (QLRS) CDMA where K users access a point through a common channel with spectral spreading factor N. Each bit is extended by a temporal spreading factor B and hopped on a BN-chip random sequence that is spread in time and frequency. Each user multiplexes and transmits B ext... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3430 | A Class of Nonbinary Codes and Their Weight Distribution | [
"cs.IT",
"math.IT"
] | In this paper, for an even integer $n\geq 4$ and any positive integer $k$ with ${\rm gcd}(n/2,k)={\rm gcd}(n/2-k,2k)=d$ being odd, a class of $p$-ary codes $\mathcal{C}^k$ is defined and their weight distribution is completely determined, where $p$ is an odd prime. As an application, a class of nonbinary sequence famil... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3437 | On Cusick-Cheon's Conjecture About Balanced Boolean Functions in the
Cosets of the Binary Reed-Muller Code | [
"cs.IT",
"math.IT"
] | It is proved an amplification of Cusick-Cheon's conjecture on balanced Boolean functions in the cosets of the binary Reed-Muller code RM(k,m) of order k and length 2^m, in the cases where k = 1 or k >= (m-1)/2. | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3448 | Sketch-Based Estimation of Subpopulation-Weight | [
"cs.DB",
"cs.DS",
"cs.NI",
"cs.PF"
] | Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a predicate over records' attributes. Bottom-k sketches are a powerful summarization format of weighted items that includes priority sampling a... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 1,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3490 | On capacity of wireless ad hoc networks with MIMO MMSE receivers | [
"cs.NI",
"cs.IT",
"math.IT"
] | Widely adopted at home, business places, and hot spots, wireless ad-hoc networks are expected to provide broadband services parallel to their wired counterparts in near future. To address this need, MIMO techniques, which are capable of offering several-fold increase in capacity, hold significant promise. Most previous... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3495 | Gaussian Interference Networks: Sum Capacity in the Low Interference
Regime and New Outer Bounds on the Capacity Region | [
"cs.IT",
"math.IT"
] | Establishing the capacity region of a Gaussian interference network is an open problem in information theory. Recent progress on this problem has led to the characterization of the capacity region of a general two user Gaussian interference channel within one bit. In this paper, we develop new, improved outer bounds on... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3522 | Time Warp Edit Distance | [
"cs.IR"
] | This technical report details a family of time warp distances on the set of discrete time series. This family is constructed as an editing distance whose elementary operations apply on linear segments. A specific parameter allows controlling the stiffness of the elastic matching. It is well suited for the processing of... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 1,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3528 | Wavelet and Curvelet Moments for Image Classification: Application to
Aggregate Mixture Grading | [
"cs.CV"
] | We show the potential for classifying images of mixtures of aggregate, based themselves on varying, albeit well-defined, sizes and shapes, in order to provide a far more effective approach compared to the classification of individual sizes and shapes. While a dominant (additive, stationary) Gaussian noise component in ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 1,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3535 | Approximate Capacity of Gaussian Relay Networks | [
"cs.IT",
"math.IT"
] | We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set upper bound on the capacity of these networks. This constant depends on the topology of the network, but not the values of the channel gains. The... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3563 | Distributed Sensor Localization in Random Environments using Minimal
Number of Anchor Nodes | [
"cs.IT",
"math.IT"
] | The paper develops DILOC, a \emph{distributive}, \emph{iterative} algorithm that locates M sensors in $\mathbb{R}^m, m\geq 1$, with respect to a minimal number of m+1 anchors with known locations. The sensors exchange data with their neighbors only; no centralized data processing or communication occurs, nor is there c... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3570 | Asymptotic Behaviour of Random Vandermonde Matrices with Entries on the
Unit Circle | [
"cs.IT",
"math.IT"
] | Analytical methods for finding moments of random Vandermonde matrices with entries on the unit circle are developed. Vandermonde Matrices play an important role in signal processing and wireless applications such as direction of arrival estimation, precoding, and sparse sampling theory, just to name a few. Within this ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3572 | Random Vandermonde Matrices-Part II: Applications | [
"cs.IT",
"math.IT"
] | This paper has been withdrawn by the authors, since it has been merged with Part I (ID 0802.3570) | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3582 | Neural Networks and Database Systems | [
"cs.DB",
"cs.NE"
] | Object-oriented database systems proved very valuable at handling and administrating complex objects. In the following guidelines for embedding neural networks into such systems are presented. It is our goal to treat networks as normal data in the database system. From the logical point of view, a neural network is a c... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 1,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 1,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3597 | Processing Information in Quantum Decision Theory | [
"physics.soc-ph",
"cs.AI",
"quant-ph"
] | A survey is given summarizing the state of the art of describing information processing in Quantum Decision Theory, which has been recently advanced as a novel variant of decision making, based on the mathematical theory of separable Hilbert spaces. This mathematical structure captures the effect of superposition of co... | {
"Other": 0,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3611 | Power Allocation for Fading Channels with Peak-to-Average Power
Constraints | [
"cs.IT",
"math.IT"
] | Power allocation with peak-to-average power ratio constraints is investigated for transmission over Nakagami-m fading channels with arbitrary input distributions. In the case of delay-limited block-fading channels, we find the solution to the minimum outage power allocation scheme with peak-to-average power constraints... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3746 | Information Hiding Techniques: A Tutorial Review | [
"cs.CR",
"cs.IR"
] | The purpose of this tutorial is to present an overview of various information hiding techniques. A brief history of steganography is provided along with techniques that were used to hide information. Text, image and audio based information hiding techniques are discussed. This paper also provides a basic introduction t... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 1,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 1,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3784 | Pattern-Oriented Analysis and Design (POAD) Theory | [
"cs.SE",
"cs.IT",
"math.IT"
] | Pattern-Oriented Analysis and Design (POAD) is the practice of building complex software by applying proven designs to specific problem domains. Although a great deal of research and practice has been devoted to formalizing existing design patterns and discovering new ones, there has been relatively little research int... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3789 | Knowledge Technologies | [
"cs.CY",
"cs.AI",
"cs.LG",
"cs.SE"
] | Several technologies are emerging that provide new ways to capture, store, present and use knowledge. This book is the first to provide a comprehensive introduction to five of the most important of these technologies: Knowledge Engineering, Knowledge Based Engineering, Knowledge Webs, Ontologies and Semantic Webs. For ... | {
"Other": 1,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 1,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 1,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3851 | Joint Source Channel Coding with Side Information Using Hybrid Digital
Analog Codes | [
"cs.IT",
"math.IT"
] | We study the joint source channel coding problem of transmitting an analog source over a Gaussian channel in two cases - (i) the presence of interference known only to the transmitter and (ii) in the presence of side information known only to the receiver. We introduce hybrid digital analog forms of the Costa and Wyner... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3875 | Are complex systems hard to evolve? | [
"cs.NE"
] | Evolutionary complexity is here measured by the number of trials/evaluations needed for evolving a logical gate in a non-linear medium. Behavioural complexity of the gates evolved is characterised in terms of cellular automata behaviour. We speculate that hierarchies of behavioural and evolutionary complexities are iso... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 1,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3950 | Belief Propagation and Loop Series on Planar Graphs | [
"cond-mat.stat-mech",
"cs.AI",
"cs.IT",
"math.IT"
] | We discuss a generic model of Bayesian inference with binary variables defined on edges of a planar graph. The Loop Calculus approach of [1, 2] is used to evaluate the resulting series expansion for the partition function. We show that, for planar graphs, truncating the series at single-connected loops reduces, via a m... | {
"Other": 0,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.3992 | Polynomial Filtering for Fast Convergence in Distributed Consensus | [
"cs.IT",
"math.IT"
] | In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods proposed in the literature address the consensus averaging problem by distributed linear iterative algorithms, with asymptotic convergence of the consensus s... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4002 | Sensing Danger: Innate Immunology for Intrusion Detection | [
"cs.NE",
"cs.CR"
] | The immune system provides an ideal metaphor for anomaly detection in general and computer security in particular. Based on this idea, artificial immune systems have been used for a number of years for intrusion detection, unfortunately so far with little success. However, these previous systems were largely based on i... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 1,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 1,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4010 | Brain architecture: A design for natural computation | [
"q-bio.NC",
"cs.AI",
"cs.NE",
"physics.soc-ph"
] | Fifty years ago, John von Neumann compared the architecture of the brain with that of computers that he invented and which is still in use today. In those days, the organisation of computers was based on concepts of brain organisation. Here, we give an update on current results on the global organisation of neural syst... | {
"Other": 0,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 1,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4079 | Families of LDPC Codes Derived from Nonprimitive BCH Codes and
Cyclotomic Cosets | [
"cs.IT",
"math.IT"
] | Low-density parity check (LDPC) codes are an important class of codes with many applications. Two algebraic methods for constructing regular LDPC codes are derived -- one based on nonprimitive narrow-sense BCH codes and the other directly based on cyclotomic cosets. The constructed codes have high rates and are free of... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4089 | An algorithmic complexity interpretation of Lin's third law of
information theory | [
"cs.CC",
"cs.IT",
"math.IT"
] | Instead of static entropy we assert that the Kolmogorov complexity of a static structure such as a solid is the proper measure of disorder (or chaoticity). A static structure in a surrounding perfectly-random universe acts as an interfering entity which introduces local disruption in randomness. This is modeled by a se... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4101 | New bounds on classical and quantum one-way communication complexity | [
"cs.IT",
"cs.DC",
"math.IT"
] | In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical model, our bound extends the well known upper bound of Kremer, Nisan and Ron to include non-product distributions. We show that for a boolean function f... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4112 | Hubs in Languages: Scale Free Networks of Synonyms | [
"physics.soc-ph",
"cs.CL",
"physics.data-an"
] | Natural languages are described in this paper in terms of networks of synonyms: a word is identified with a node, and synonyms are connected by undirected links. Our statistical analysis of the network of synonyms in Polish language showed it is scale-free; similar to what is known for English. The statistical properti... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 1,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4126 | Hospital Case Cost Estimates Modelling - Algorithm Comparison | [
"cs.CE",
"cs.DB"
] | Ontario (Canada) Health System stakeholders support the idea and necessity of the integrated source of data that would include both clinical (e.g. diagnosis, intervention, length of stay, case mix group) and financial (e.g. cost per weighted case, cost per diem) characteristics of the Ontario healthcare system activiti... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 1,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 1,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4130 | Wideband Spectrum Sensing in Cognitive Radio Networks | [
"cs.IT",
"math.IT"
] | Spectrum sensing is an essential enabling functionality for cognitive radio networks to detect spectrum holes and opportunistically use the under-utilized frequency bands without causing harmful interference to legacy networks. This paper introduces a novel wideband spectrum sensing technique, called multiband joint de... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4198 | Some properties of the Ukrainian writing system | [
"cs.CL"
] | We investigate the grapheme-phoneme relation in Ukrainian and some properties of the Ukrainian version of the Cyrillic alphabet. | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 1,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4215 | Equilibrium (Zipf) and Dynamic (Grasseberg-Procaccia) method based
analyses of human texts. A comparison of natural (english) and artificial
(esperanto) languages | [
"physics.soc-ph",
"cs.CL",
"physics.data-an"
] | A comparison of two english texts from Lewis Carroll, one (Alice in wonderland), also translated into esperanto, the other (Through a looking glass) are discussed in order to observe whether natural and artificial languages significantly differ from each other. One dimensional time series like signals are constructed u... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 1,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4233 | Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio
Channels | [
"cs.IT",
"math.IT"
] | In this paper, the sum capacity of the Gaussian Multiple Input Multiple Output (MIMO) Cognitive Radio Channel (MCC) is expressed as a convex problem with finite number of linear constraints, allowing for polynomial time interior point techniques to find the solution. In addition, a specialized class of sum power iterat... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4270 | Propagation Rules of Subsystem Codes | [
"quant-ph",
"cs.IT",
"math.IT"
] | We demonstrate propagation rules of subsystem code constructions by extending, shortening and combining given subsystem codes. Given an $[[n,k,r,d]]_q$ subsystem code, we drive new subsystem codes with parameters $[[n+1,k,r,\geq d]]_q$, $[[n-1,k+1,r,\geq d-1]]_q$, $[[n,k-1,r+1,d]]_q$. The interested readers shall consu... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4282 | Distributed Opportunistic Scheduling For Ad-Hoc Communications Under
Noisy Channel Estimation | [
"cs.IT",
"math.IT"
] | Distributed opportunistic scheduling is studied for wireless ad-hoc networks, where many links contend for one channel using random access. In such networks, distributed opportunistic scheduling (DOS) involves a process of joint channel probing and distributed scheduling. It has been shown that under perfect channel es... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4284 | Distributed Opportunistic Scheduling for MIMO Ad-Hoc Networks | [
"cs.IT",
"math.IT"
] | Distributed opportunistic scheduling (DOS) protocols are proposed for multiple-input multiple-output (MIMO) ad-hoc networks with contention-based medium access. The proposed scheduling protocols distinguish themselves from other existing works by their explicit design for system throughput improvement through exploitin... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4291 | Opportunistic Scheduling and Beamforming for MIMO-OFDMA Downlink Systems
with Reduced Feedback | [
"cs.IT",
"math.IT"
] | Opportunistic scheduling and beamforming schemes with reduced feedback are proposed for MIMO-OFDMA downlink systems. Unlike the conventional beamforming schemes in which beamforming is implemented solely by the base station (BS) in a per-subcarrier fashion, the proposed schemes take advantages of a novel channel decomp... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4299 | SINR Analysis of Opportunistic MIMO-SDMA Downlink Systems with Linear
Combining | [
"cs.IT",
"math.IT"
] | Opportunistic scheduling (OS) schemes have been proposed previously by the authors for multiuser MIMO-SDMA downlink systems with linear combining. In particular, it has been demonstrated that significant performance improvement can be achieved by incorporating low-complexity linear combining techniques into the design ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4326 | The Generation of Textual Entailment with NLML in an Intelligent
Dialogue system for Language Learning CSIEC | [
"cs.CL",
"cs.AI",
"cs.CY"
] | This research report introduces the generation of textual entailment within the project CSIEC (Computer Simulation in Educational Communication), an interactive web-based human-computer dialogue system with natural language for English instruction. The generation of textual entailment (GTE) is critical to the further i... | {
"Other": 0,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 1,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 1,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4330 | Eigenvalue Estimates and Mutual Information for the Linear Time-Varying
Channel | [
"cs.IT",
"math.IT"
] | We consider linear time-varying channels with additive white Gaussian noise. For a large class of such channels we derive rigorous estimates of the eigenvalues of the correlation matrix of the effective channel in terms of the sampled time-varying transfer function and, thus, provide a theoretical justification for a r... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4344 | An Improved Scheme for Initial Ranging in OFDMA-based Networks | [
"cs.IT",
"cs.OH",
"math.IT"
] | An efficient scheme for initial ranging has recently been proposed by X. Fu et al. in the context of orthogonal frequency-division multiple-access (OFDMA) networks based on the IEEE 802.16e-2005 standard. The proposed solution aims at estimating the power levels and timing offsets of the ranging subscriber stations (RS... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4363 | Estimating the entropy of binary time series: Methodology, some theory
and a simulation study | [
"cs.IT",
"math.IT",
"math.ST",
"stat.TH"
] | Partly motivated by entropy-estimation problems in neuroscience, we present a detailed and extensive comparison between some of the most popular and effective entropy estimation methods used in practice: The plug-in method, four different estimators based on the Lempel-Ziv (LZ) family of data compression algorithms, an... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4390 | Low Complexity Sphere Decoding for Spatial Multiplexing MIMO | [
"cs.IT",
"math.IT"
] | In this paper we present a novel method for decoding multiple input - multiple output (MIMO) transmission, which combines sphere decoding (SD) and zero forcing (ZF) techniques to provide near optimal low complexity and high performance constant time modified sphere decoding algorithm. This algorithm was designed especi... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0802.4450 | A Study On Distributed Model Predictive Consensus | [
"cs.MA"
] | We investigate convergence properties of a proposed distributed model predictive control (DMPC) scheme, where agents negotiate to compute an optimal consensus point using an incremental subgradient method based on primal decomposition as described in Johansson et al. [2006, 2007]. The objective of the distributed contr... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 1,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0014 | Automated Termination Proofs for Logic Programs by Term Rewriting | [
"cs.LO",
"cs.AI",
"cs.PL"
] | There are two kinds of approaches for termination analysis of logic programs: "transformational" and "direct" ones. Direct approaches prove termination directly on the basis of the logic program. Transformational approaches transform a logic program into a term rewrite system (TRS) and then analyze termination of the r... | {
"Other": 1,
"cs.AI": 1,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0032 | Composition Attacks and Auxiliary Information in Data Privacy | [
"cs.DB",
"cs.CR"
] | Privacy is an increasingly important aspect of data publishing. Reasoning about privacy, however, is fraught with pitfalls. One of the most significant is the auxiliary information (also called external knowledge, background knowledge, or side information) that an adversary gleans from other channels such as the web, p... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 1,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 1,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0053 | Mobile Agents for Content-Based WWW Distributed Image Retrieval | [
"cs.DC",
"cs.IR"
] | At present, the de-facto standard for providing contents in the Internet is the World Wide Web. A technology, which is now emerging on the Web, is Content-Based Image Retrieval (CBIR). CBIR applies methods and algorithms from computer science to analyse and index images based on their visual content. Mobile agents push... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 1,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0146 | Polynomial time algorithms for bi-criteria, multi-objective and ratio
problems in clustering and imaging. Part I: Normalized cut and ratio regions | [
"cs.CV",
"cs.DM"
] | Partitioning and grouping of similar objects plays a fundamental role in image segmentation and in clustering problems. In such problems a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time another goal is to have each group distinctly dissimilar from the rest... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 1,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0189 | Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs | [
"cs.DC",
"cs.PF",
"cs.RO"
] | This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions for the gossip problem, where agents may start from arbitrary locations in arbitrary states. Self-stabilization requires (... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 1,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0194 | Acquisition Accuracy Evaluation in Visual Inspection Systems - a
Practical Approach | [
"cs.CV",
"cs.MM"
] | This paper draws a proposal of a set of parameters and methods for accuracy evaluation of visual inspection systems. The case of a monochrome board is treated, but practically all conclusions and methods may be extended for colour acquisition. Basically, the proposed parameters are grouped in five sets as follows:Inter... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 1,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0265 | Blind Fingerprinting | [
"cs.IT",
"math.IT"
] | We study blind fingerprinting, where the host sequence into which fingerprints are embedded is partially or completely unknown to the decoder. This problem relates to a multiuser version of the Gel'fand-Pinsker problem. The number of colluders and the collusion channel are unknown, and the colluders and the fingerprint... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0398 | In-depth analysis of the Naming Game dynamics: the homogeneous mixing
case | [
"physics.soc-ph",
"cond-mat.stat-mech",
"cs.GT",
"cs.MA"
] | Language emergence and evolution has recently gained growing attention through multi-agent models and mathematical frameworks to study their behavior. Here we investigate further the Naming Game, a model able to account for the emergence of a shared vocabulary of form-meaning associations through social/cultural learni... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 1,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0405 | Multi-dimensional sparse time series: feature extraction | [
"cs.MM",
"cs.IR"
] | We show an analysis of multi-dimensional time series via entropy and statistical linguistic techniques. We define three markers encoding the behavior of the series, after it has been translated into a multi-dimensional symbolic sequence. The leading component and the trend of the series with respect to a mobile window ... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 1,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0428 | Zero-Forcing Precoding for Frequency Selective MIMO Channels with
$H^\infty$ Criterion and Causality Constraint | [
"cs.IT",
"math.IT"
] | We consider zero-forcing equalization of frequency selective MIMO channels by causal and linear time-invariant precoders in the presence of intersymbol interference. Our motivation is twofold. First, we are concerned with the optimal performance of causal precoders from a worst case point of view. Therefore we construc... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0450 | Inferring Neuronal Network Connectivity from Spike Data: A Temporal
Datamining Approach | [
"cs.DB",
"q-bio.NC"
] | Understanding the functioning of a neural system in terms of its underlying circuitry is an important problem in neuroscience. Recent developments in electrophysiology and imaging allow one to simultaneously record activities of hundreds of neurons. Inferring the underlying neuronal connectivity patterns from such mult... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 1,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0597 | Cooperative Spectrum Sensing Using Random Matrix Theory | [
"cs.IT",
"math.IT"
] | In this paper, using tools from asymptotic random matrix theory, a new cooperative scheme for frequency band sensing is introduced for both AWGN and fading channels. Unlike previous works in the field, the new scheme does not require the knowledge of the noise statistics or its variance and is related to the behavior o... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0610 | On the Approximate Eigenstructure of Time-Varying Channels | [
"cs.IT",
"math.IT"
] | In this article we consider the approximate description of doubly--dispersive channels by its symbol. We focus on channel operators with compactly supported spreading, which are widely used to represent fast fading multipath communication channels. The concept of approximate eigenstructure is introduced, which measures... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0632 | Network Coding for Distributed Storage Systems | [
"cs.NI",
"cs.IT",
"math.IT"
] | Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-peer storage systems, and storage in wireless networks. Storing data using an erasure code, in fragments spread across nodes, requires less redund... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0731 | Complexity Analysis of Reed-Solomon Decoding over GF(2^m) Without Using
Syndromes | [
"cs.IT",
"cs.CC",
"cs.DS",
"math.IT"
] | For the majority of the applications of Reed-Solomon (RS) codes, hard decision decoding is based on syndromes. Recently, there has been renewed interest in decoding RS codes without using syndromes. In this paper, we investigate the complexity of syndromeless decoding for RS codes, and compare it to that of syndrome-ba... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0755 | Toeplitz Block Matrices in Compressed Sensing | [
"cs.IT",
"math.IT",
"math.PR"
] | Recent work in compressed sensing theory shows that $n\times N$ independent and identically distributed (IID) sensing matrices whose entries are drawn independently from certain probability distributions guarantee exact recovery of a sparse signal with high probability even if $n\ll N$. Motivated by signal processing a... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0764 | Asymmetric and Symmetric Subsystem BCH Codes and Beyond | [
"quant-ph",
"cs.IT",
"math.IT"
] | Recently, the theory of quantum error control codes has been extended to subsystem codes over symmetric and asymmetric quantum channels -- qubit-flip and phase-shift errors may have equal or different probabilities. Previous work in constructing quantum error control codes has focused on code constructions for symmetri... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0778 | Constant-Rank Codes | [
"cs.IT",
"math.IT"
] | Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random network coding. In this paper, we show that constant-rank codes are closely related to constant-dimension codes and we study the properties of constant-rank codes. We first introduce a relation bet... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0811 | Subspace Pursuit for Compressive Sensing Signal Reconstruction | [
"cs.NA",
"cs.IT",
"math.IT"
] | We propose a new method for reconstruction of sparse signals with and without noisy perturbations, termed the subspace pursuit algorithm. The algorithm has two important characteristics: low computational complexity, comparable to that of orthogonal matching pursuit techniques when applied to very sparse signals, and r... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0822 | Website Optimization through Mining User Navigational Pattern | [
"cs.IR"
] | With the World Wide Web's ubiquity increase and the rapid development of various online businesses, the complexity of web sites grow. The analysis of web user's navigational pattern within a web site can provide useful information for server performance enhancements, restructuring a website and direct marketing in e-co... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 1,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0875 | Vandermonde Frequency Division Multiplexing for Cognitive Radio | [
"cs.IT",
"math.IT"
] | We consider a cognitive radio scenario where a primary and a secondary user wish to communicate with their corresponding receivers simultaneously over frequency selective channels. Under realistic assumptions that the secondary transmitter has no side information about the primary's message and each transmitter knows o... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 0,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 1,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0924 | What Can We Learn Privately? | [
"cs.LG",
"cs.CC",
"cs.CR",
"cs.DB"
] | Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept classes can be learned privately, namely, by an algorithm whose output does not depend too heavily on any one input or specific training exam... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 1,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 1,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 1,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0954 | Selective association rule generation | [
"cs.DB",
"cs.DS"
] | Mining association rules is a popular and well researched method for discovering interesting relations between variables in large databases. A practical problem is that at medium to low support values often a large number of frequent itemsets and an even larger number of association rules are found in a database. A wid... | {
"Other": 1,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 1,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
0803.0966 | New probabilistic interest measures for association rules | [
"cs.DB",
"stat.ML"
] | Mining association rules is an important technique for discovering meaningful patterns in transaction databases. Many different measures of interestingness have been proposed for association rules. However, these measures fail to take the probabilistic properties of the mined data into account. In this paper, we start ... | {
"Other": 0,
"cs.AI": 0,
"cs.CE": 0,
"cs.CL": 0,
"cs.CR": 0,
"cs.CV": 0,
"cs.CY": 0,
"cs.DB": 1,
"cs.HC": 0,
"cs.IR": 0,
"cs.IT": 0,
"cs.LG": 0,
"cs.MA": 0,
"cs.NE": 0,
"cs.RO": 0,
"cs.SD": 0,
"cs.SI": 0,
"cs.SY": 0
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.