id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0909.2719 | Standards for Language Resources | cs.CL | This paper presents an abstract data model for linguistic annotations and its
implementation using XML, RDF and related standards; and to outline the work of
a newly formed committee of the International Standards Organization (ISO),
ISO/TC 37/SC 4 Language Resource Management, which will use this work as its
startin... |
0909.2737 | Compressive sensing by white random convolution | math.OC cs.IT math.IT | A different compressive sensing framework, convolution with white noise
waveform followed by subsampling at fixed (not randomly selected) locations, is
studied in this paper. We show that its recoverability for sparse signals
depends on the coherence (denoted by mu) between the signal representation and
the Fourier b... |
0909.2777 | On the Symmetric Gaussian Interference Channel with Partial
Unidirectional Cooperation | cs.IT math.IT | A two-user symmetric Gaussian Interference Channel (IC) is considered in
which a noiseless unidirectional link connects one encoder to the other. Having
a constant capacity, the additional link provides partial cooperation between
the encoders. It is shown that the available cooperation can dramatically
increase the ... |
0909.2817 | Strongly Cancellative and Recovering Sets On Lattices | math.CO cs.IT math.IT | We use information theory to study recovering sets $\R_L$ and strongly
cancellative sets $\C_L$ on different lattices. These sets are special classes
of recovering pairs and cancellative sets previously discussed in [1], [3] and
[5]. We mainly focus on the lattices $B_n$ and $D_{l}^{k}$. Specifically, we
find upper b... |
0909.2894 | Adaptive Spatial Intercell Interference Cancellation in Multicell
Wireless Networks | cs.IT math.IT | Downlink spatial intercell interference cancellation (ICIC) is considered for
mitigating other-cell interference using multiple transmit antennas. A
principle question we explore is whether it is better to do ICIC or simply
standard single-cell beamforming. We explore this question analytically and
show that beamform... |
0909.2927 | Distribution-Specific Agnostic Boosting | cs.LG cs.CC | We consider the problem of boosting the accuracy of weak learning algorithms
in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992).
Known algorithms for this problem (Ben-David et al., 2001; Gavinsky, 2002;
Kalai et al., 2008) follow the same strategy as boosting algorithms in the PAC
model: ... |
0909.2934 | A Convergent Online Single Time Scale Actor Critic Algorithm | cs.LG cs.AI | Actor-Critic based approaches were among the first to address reinforcement
learning in a general setting. Recently, these algorithms have gained renewed
interest due to their generality, good convergence properties, and possible
biological relevance. In this paper, we introduce an online temporal difference
based ac... |
0909.3027 | Language Models for Handwritten Short Message Services | cs.CL | Handwriting is an alternative method for entering texts composing Short
Message Services. However, a whole new language features the texts which are
produced. They include for instance abbreviations and other consonantal writing
which sprung up for time saving and fashion. We have collected and processed a
significan... |
0909.3028 | Vers la reconnaissance de mini-messages manuscrits | cs.CL | Handwriting is an alternative method for entering texts which composed Short
Message Services. However, a whole new language features the texts which are
produced. They include for instance abbreviations and other consonantal writing
which sprung up for time saving and fashion. We have collected and processed a
signi... |
0909.3055 | Compressive Sensing Based Opportunistic Protocol for Throughput
Improvement in Wireless Networks | cs.IT math.IT | A key feature in the design of any MAC protocol is the throughput it can
provide. In wireless networks, the channel of a user is not fixed but varies
randomly. Thus, in order to maximize the throughput of the MAC protocol at any
given time, only users with large channel gains should be allowed to transmit.
In this pa... |
0909.3123 | Median K-flats for hybrid linear modeling with many outliers | cs.CV cs.LG | We describe the Median K-Flats (MKF) algorithm, a simple online method for
hybrid linear modeling, i.e., for approximating data by a mixture of flats.
This algorithm simultaneously partitions the data into clusters while finding
their corresponding best approximating l1 d-flats, so that the cumulative l1
error is min... |
0909.3131 | Constructing Linear Encoders with Good Spectra | cs.IT math.IT | Linear encoders with good joint spectra are suitable candidates for optimal
lossless joint source-channel coding (JSCC), where the joint spectrum is a
variant of the input-output complete weight distribution and is considered good
if it is close to the average joint spectrum of all linear encoders (of the
same coding... |
0909.3135 | A Random Variable Substitution Lemma With Applications to Multiple
Description Coding | cs.IT math.IT | We establish a random variable substitution lemma and use it to investigate
the role of refinement layer in multiple description coding, which clarifies
the relationship among several existing achievable multiple description
rate-distortion regions. Specifically, it is shown that the El Gamal-Cover
(EGC) region is eq... |
0909.3146 | An Authentication Code against Pollution Attacks in Network Coding | cs.IT cs.CR math.IT | Systems exploiting network coding to increase their throughput suffer greatly
from pollution attacks which consist of injecting malicious packets in the
network. The pollution attacks are amplified by the network coding process,
resulting in a greater damage than under traditional routing. In this paper, we
address t... |
0909.3165 | Finite-time Consensus for Nonlinear Multi-agent Systems with Fixed
Topologies | cs.IT cs.MA math.IT math.OC | In this paper, we study finite-time state consensus problems for continuous
nonlinear multi-agent systems. Building on the theory of finite-time Lyapunov
stability, we propose sufficient criteria which guarantee the system to reach a
consensus in finite time, provided that the underlying directed network
contains a s... |
0909.3169 | On Low Distortion Embeddings of Statistical Distance Measures into Low
Dimensional Spaces | cs.CG cs.DB | Statistical distance measures have found wide applicability in information
retrieval tasks that typically involve high dimensional datasets. In order to
reduce the storage space and ensure efficient performance of queries,
dimensionality reduction while preserving the inter-point similarity is highly
desirable. In th... |
0909.3185 | Construction of Additive Reed-Muller Codes | cs.IT math.IT | The well known Plotkin construction is, in the current paper, generalized and
used to yield new families of Z2Z4-additive codes, whose length, dimension as
well as minimum distance are studied. These new constructions enable us to
obtain families of Z2Z4-additive codes such that, under the Gray map, the
corresponding... |
0909.3226 | Blind user detection in doubly-dispersive DS/CDMA channels | cs.IT math.IT | In this work, we consider the problem of detecting the presence of a new user
in a direct-sequence/code-division-multiple-access (DS/CDMA) system with a
doubly-dispersive fading channel, and we propose a novel blind detection
strategy which only requires knowledge of the spreading code of the user to be
detected, but... |
0909.3257 | The Shield that Never Was: Societies with Single-Peaked Preferences are
More Open to Manipulation and Control | cs.GT cs.CC cs.MA physics.soc-ph | Much work has been devoted, during the past twenty years, to using complexity
to protect elections from manipulation and control. Many results have been
obtained showing NP-hardness shields, and recently there has been much focus on
whether such worst-case hardness protections can be bypassed by frequently
correct he... |
0909.3273 | Decomposition of the NVALUE constraint | cs.AI | We study decompositions of NVALUE, a global constraint that can be used to
model a wide range of problems where values need to be counted. Whilst
decomposition typically hinders propagation, we identify one decomposition that
maintains a global view as enforcing bound consistency on the decomposition
achieves bound c... |
0909.3276 | Symmetries of Symmetry Breaking Constraints | cs.AI | Symmetry is an important feature of many constraint programs. We show that
any symmetry acting on a set of symmetry breaking constraints can be used to
break symmetry. Different symmetries pick out different solutions in each
symmetry class. We use these observations in two methods for eliminating
symmetry from a pro... |
0909.3382 | Statistical mechanical analysis of the Kronecker channel model for MIMO
wireless communication | cs.IT cond-mat.dis-nn cond-mat.stat-mech math.IT | The Kronecker channel model of wireless communication is analyzed using
statistical mechanics methods. In the model, spatial proximities among
transmission/reception antennas are taken into account as certain correlation
matrices, which generally yield non-trivial dependence among symbols to be
estimated. This preven... |
0909.3384 | Comparing Single and Multiobjective Evolutionary Approaches to the
Inventory and Transportation Problem | cs.NE | EVITA, standing for Evolutionary Inventory and Transportation Algorithm, is a
two-level methodology designed to address the Inventory and Transportation
Problem (ITP) in retail chains. The top level uses an evolutionary algorithm to
obtain delivery patterns for each shop on a weekly basis so as to minimise the
invent... |
0909.3388 | Pattern occurrence in the dyadic expansion of square root of two and an
analysis of pseudorandom number generators | math.CO cs.IT math.IT | Recently, designs of pseudorandom number generators (PRNGs) using
integer-valued variants of logistic maps and their applications to some
cryptographic schemes have been studied, due mostly to their ease of
implementation and performance. However, it has been noted that this ease is
reduced for some choices of the PR... |
0909.3395 | A possible low-level explanation of "temporal dynamics of brightness
induction and White's illusion" | cs.CV physics.bio-ph q-bio.NC | Based upon physiological observation on time dependent orientation
selectivity in the cells of macaque's primary visual cortex together with the
psychophysical studies on the tuning of orientation detectors in human vision
we suggest that time dependence in brightness perception can be accommodated
through the time e... |
0909.3423 | Digital Ecosystems | cs.MA cs.NE | We view Digital Ecosystems to be the digital counterparts of biological
ecosystems, which are considered to be robust, self-organising and scalable
architectures that can automatically solve complex, dynamic problems. So, this
work is concerned with the creation, investigation, and optimisation of Digital
Ecosystems,... |
0909.3444 | Analyse en d\'ependances \`a l'aide des grammaires d'interaction | cs.CL | This article proposes a method to extract dependency structures from
phrase-structure level parsing with Interaction Grammars. Interaction Grammars
are a formalism which expresses interactions among words using a polarity
system. Syntactical composition is led by the saturation of polarities.
Interactions take place ... |
0909.3445 | Grouping Synonyms by Definitions | cs.CL | We present a method for grouping the synonyms of a lemma according to its
dictionary senses. The senses are defined by a large machine readable
dictionary for French, the TLFi (Tr\'esor de la langue fran\c{c}aise
informatis\'e) and the synonyms are given by 5 synonym dictionaries (also for
French). To evaluate the pr... |
0909.3472 | The Universal Recommender | cs.IR | We describe the Universal Recommender, a recommender system for semantic
datasets that generalizes domain-specific recommenders such as content-based,
collaborative, social, bibliographic, lexicographic, hybrid and other
recommenders. In contrast to existing recommender systems, the Universal
Recommender applies to a... |
0909.3475 | Multi-agent Coordination in Directed Moving Neighborhood Random Networks | cs.MA cs.IT math.IT | In this paper, we consider the consensus problem of dynamical multiple agents
that communicate via a directed moving neighborhood random network. Each agent
performs random walk on a weighted directed network. Agents interact with each
other through random unidirectional information flow when they coincide in the
und... |
0909.3508 | Compressed Sensing with Probabilistic Measurements: A Group Testing
Solution | cs.IT cs.DM math.IT | Detection of defective members of large populations has been widely studied
in the statistics community under the name "group testing", a problem which
dates back to World War II when it was suggested for syphilis screening. There
the main interest is to identify a small number of infected people among a
large popula... |
0909.3591 | Mathematics, Recursion, and Universals in Human Languages | cs.CL | There are many scientific problems generated by the multiple and conflicting
alternative definitions of linguistic recursion and human recursive processing
that exist in the literature. The purpose of this article is to make available
to the linguistic community the standard mathematical definition of recursion
and t... |
0909.3593 | Exploiting Unlabeled Data to Enhance Ensemble Diversity | cs.LG cs.AI | Ensemble learning aims to improve generalization ability by using multiple
base learners. It is well-known that to construct a good ensemble, the base
learners should be accurate as well as diverse. In this paper, unlabeled data
is exploited to facilitate ensemble learning by helping augment the diversity
among the b... |
0909.3606 | Extension of Path Probability Method to Approximate Inference over Time | cs.LG cs.CV | There has been a tremendous growth in publicly available digital video
footage over the past decade. This has necessitated the development of new
techniques in computer vision geared towards efficient analysis, storage and
retrieval of such data. Many mid-level computer vision tasks such as
segmentation, object detec... |
0909.3609 | Randomized Algorithms for Large scale SVMs | cs.LG | We propose a randomized algorithm for training Support vector machines(SVMs)
on large datasets. By using ideas from Random projections we show that the
combinatorial dimension of SVMs is $O({log} n)$ with high probability. This
estimate of combinatorial dimension is used to derive an iterative algorithm,
called RandS... |
0909.3647 | From f-divergence to quantum quasi-entropies and their use | cs.IT math.IT math.ST quant-ph stat.TH | Csiszar's f-divergence of two probability distributions was extended to the
quantum case by the author in 1985. In the quantum setting positive
semidefinite matrices are in the place of probability distributions and the
quantum generalization is called quasi-entropy which is related to some other
important concepts a... |
0909.3648 | Random scattering of bits by prediction | cs.AI cs.IT math.IT | We investigate a population of binary mistake sequences that result from
learning with parametric models of different order. We obtain estimates of
their error, algorithmic complexity and divergence from a purely random
Bernoulli sequence. We study the relationship of these variables to the
learner's information dens... |
0909.3658 | Efficient Steganography with Provable Security Guarantees | cs.CR cs.IT math.IT | We provide a new provably-secure steganographic encryption protocol that is
proven secure in the complexity-theoretic framework of Hopper et al. The
fundamental building block of our steganographic encryption protocol is a
"one-time stegosystem" that allows two parties to transmit messages of length
shorter than the ... |
0909.3786 | Kinematic calibration of Orthoglide-type mechanisms from observation of
parallel leg motions | cs.RO | The paper proposes a new calibration method for parallel manipulators that
allows efficient identification of the joint offsets using observations of the
manipulator leg parallelism with respect to the base surface. The method
employs a simple and low-cost measuring system, which evaluates deviation of
the leg locati... |
0909.3892 | Astroinformatics: A 21st Century Approach to Astronomy | astro-ph.IM cs.DB cs.DL cs.IR physics.data-an | Data volumes from multiple sky surveys have grown from gigabytes into
terabytes during the past decade, and will grow from terabytes into tens (or
hundreds) of petabytes in the next decade. This exponential growth of new data
both enables and challenges effective astronomical research, requiring new
approaches. Thus ... |
0909.3895 | The Revolution in Astronomy Education: Data Science for the Masses | astro-ph.IM cs.DB cs.DL cs.IR physics.ed-ph | As our capacity to study ever-expanding domains of our science has increased
(including the time domain, non-electromagnetic phenomena, magnetized plasmas,
and numerous sky surveys in multiple wavebands with broad spatial coverage and
unprecedented depths), so have the horizons of our understanding of the
Universe be... |
0909.3911 | A Method for Extraction and Recognition of Isolated License Plate
Characters | cs.CV | A method to extract and recognize isolated characters in license plates is
proposed. In extraction stage, the proposed method detects isolated characters
by using Difference-of-Gaussian (DOG) function, The DOG function, similar to
Laplacian of Gaussian function, was proven to produce the most stable image
features co... |
0909.3917 | Stiffness Analysis Of Multi-Chain Parallel Robotic Systems | cs.RO | The paper presents a new stiffness modelling method for multi-chain parallel
robotic manipulators with flexible links and compliant actuating joints. In
contrast to other works, the method involves a FEA-based link stiffness
evaluation and employs a new solution strategy of the kinetostatic equations,
which allows co... |
0909.3966 | Robust THP Transceiver Designs for Multiuser MIMO Downlink with
Imperfect CSIT | cs.IT math.IT | In this paper, we present robust joint non-linear transceiver designs for
multiuser multiple-input multiple-output (MIMO) downlink in the presence of
imperfections in the channel state information at the transmitter (CSIT). The
base station (BS) is equipped with multiple transmit antennas, and each user
terminal is e... |
0909.4017 | On Degrees of Freedom Region of MIMO Networks without CSIT | cs.IT math.IT | In this paper, we study the effect of the absence of channel knowledge for
multiple-input-multiple-output (MIMO) networks. Specifically, we assume perfect
channel state information at the receivers, no channel state information at the
transmitter(s), and independent identically distributed (i.i.d.) Rayleigh
fading ac... |
0909.4126 | On an Inequality of Karlin and Rinott Concerning Weighted Sums of i.i.d.
Random Variables | cs.IT math.IT math.PR | We present an entropy comparison result concerning weighted sums of
independent and identically distributed random variables.
|
0909.4177 | On the Degrees of Freedom of Finite State Compound Wireless Networks -
Settling a Conjecture by Weingarten et. al | cs.IT math.IT | We explore the degrees of freedom (DoF) of three classes of finite state
compound wireless networks in this paper. First, we study the multiple-input
single-output (MISO) finite state compound broadcast channel (BC) with
arbitrary number of users and antennas at the transmitter. In prior work,
Weingarten et. al. have... |
0909.4196 | Personal Information Databases | cs.DB | One of the most important aspects of security organization is to establish a
framework to identify security significant points where policies and procedures
are declared. The (information) security infrastructure comprises entities,
processes, and technology. All are participants in handling information, which
is the... |
0909.4203 | Error Exponents for the Gaussian Channel with Active Noisy Feedback | cs.IT math.IT | We study the best exponential decay in the blocklength of the probability of
error that can be achieved in the transmission of a single bit over the
Gaussian channel with an active noisy Gaussian feedback link. We impose an
\emph{expected} block power constraint on the forward link and study both
\emph{almost-sure} a... |
0909.4233 | On the optimality of universal classifiers for finite-length individual
test sequences | cs.IT math.IT | We consider pairs of finite-length individual sequences that are realizations
of unknown, finite alphabet, stationary sources in a clas M of sources with
vanishing memory (e.g. stationary Markov sources).
The task of a universal classifier is to decide whether the two sequences are
emerging from the same source or ... |
0909.4280 | Towards Multimodal Content Representation | cs.CL | Multimodal interfaces, combining the use of speech, graphics, gestures, and
facial expressions in input and output, promise to provide new possibilities to
deal with information in more effective and efficient ways, supporting for
instance: - the understanding of possibly imprecise, partial or ambiguous
multimodal in... |
0909.4349 | Leader-following Consensus Problems with a Time-varying Leader under
Measurement Noises | cs.MA cs.IT math.IT | In this paper, we consider a leader-following consensus problem for networks
of continuous-time integrator agents with a time-varying leader under
measurement noises. We propose a neighbor-based state-estimation protocol for
every agent to track the leader, and time-varying consensus gains are
introduced to attenuate... |
0909.4359 | Sparse Signal Reconstruction via Iterative Support Detection | cs.IT math.IT math.NA math.OC | We present a novel sparse signal reconstruction method "ISD", aiming to
achieve fast reconstruction and a reduced requirement on the number of
measurements compared to the classical l_1 minimization approach. ISD addresses
failed reconstructions of l_1 minimization due to insufficient measurements. It
estimates a sup... |
0909.4385 | The meta book and size-dependent properties of written language | physics.soc-ph cs.CL physics.data-an | Evidence is given for a systematic text-length dependence of the power-law
index gamma of a single book. The estimated gamma values are consistent with a
monotonic decrease from 2 to 1 with increasing length of a text. A direct
connection to an extended Heap's law is explored. The infinite book limit is,
as a consequ... |
0909.4409 | Clustering with Obstacles in Spatial Databases | cs.DB | Clustering large spatial databases is an important problem, which tries to
find the densely populated regions in a spatial area to be used in data mining,
knowledge discovery, or efficient information retrieval. However most
algorithms have ignored the fact that physical obstacles such as rivers, lakes,
and highways ... |
0909.4412 | Algorithm for Spatial Clustering with Obstacles | cs.DB | In this paper, we propose an efficient clustering technique to solve the
problem of clustering in the presence of obstacles. The proposed algorithm
divides the spatial area into rectangular cells. Each cell is associated with
statistical information that enables us to label the cell as dense or
non-dense. We also lab... |
0909.4416 | A baseline for content-based blog classification | cs.IR | A content-based network representation of web logs (blogs) using a basic
word-overlap similarity measure is presented. Due to a strong signal in blog
data the approach is sufficient for accurately classifying blogs. Using Swedish
blog data we demonstrate that blogs that treat similar subjects are organized
in cluster... |
0909.4437 | Manipulation and gender neutrality in stable marriage procedures | cs.AI cs.GT | The stable marriage problem is a well-known problem of matching men to women
so that no man and woman who are not married to each other both prefer each
other. Such a problem has a wide variety of practical applications ranging from
matching resident doctors to hospitals to matching students to schools. A
well-known ... |
0909.4441 | Dealing with incomplete agents' preferences and an uncertain agenda in
group decision making via sequential majority voting | cs.AI cs.GT cs.MA | We consider multi-agent systems where agents' preferences are aggregated via
sequential majority voting: each decision is taken by performing a sequence of
pairwise comparisons where each comparison is a weighted majority vote among
the agents. Incompleteness in the agents' preferences is common in many
real-life set... |
0909.4446 | Elicitation strategies for fuzzy constraint problems with missing
preferences: algorithms and experimental studies | cs.AI | Fuzzy constraints are a popular approach to handle preferences and
over-constrained problems in scenarios where one needs to be cautious, such as
in medical or space applications. We consider here fuzzy constraint problems
where some of the preferences may be missing. This models, for example,
settings where agents a... |
0909.4452 | Flow-Based Propagators for the SEQUENCE and Related Global Constraints | cs.AI | We propose new filtering algorithms for the SEQUENCE constraint and some
extensions of the SEQUENCE constraint based on network flows. We enforce domain
consistency on the SEQUENCE constraint in $O(n^2)$ time down a branch of the
search tree. This improves upon the best existing domain consistency algorithm
by a fact... |
0909.4456 | The Weighted CFG Constraint | cs.AI | We introduce the weighted CFG constraint and propose a propagation algorithm
that enforces domain consistency in $O(n^3|G|)$ time. We show that this
algorithm can be decomposed into a set of primitive arithmetic constraints
without hindering propagation.
|
0909.4474 | Reconstruction of the equilibrium of the plasma in a Tokamak and
identification of the current density profile in real time | math.NA cs.SY math.AP math.OC | The reconstruction of the equilibrium of a plasma in a Tokamak is a free
boundary problem described by the Grad-Shafranov equation in axisymmetric
configuration. The right-hand side of this equation is a nonlinear source,
which represents the toroidal component of the plasma current density. This
paper deals with the... |
0909.4484 | Error exponents for Neyman-Pearson detection of a continuous-time
Gaussian Markov process from noisy irregular samples | cs.IT math.IT | This paper addresses the detection of a stochastic process in noise from
irregular samples. We consider two hypotheses. The \emph{noise only} hypothesis
amounts to model the observations as a sample of a i.i.d. Gaussian random
variables (noise only). The \emph{signal plus noise} hypothesis models the
observations as ... |
0909.4573 | Efficient Linear Precoding in Downlink Cooperative Cellular Networks
with Soft Interference Nulling | cs.IT math.IT | A simple line network model is proposed to study the downlink cellular
network. Without base station cooperation, the system is interference-limited.
The interference limitation is overcome when the base stations are allowed to
jointly encode the user signals, but the capacity-achieving dirty paper coding
scheme can ... |
0909.4575 | Randomness Efficient Steganography | cs.CR cs.IT math.IT | Steganographic protocols enable one to embed covert messages into
inconspicuous data over a public communication channel in such a way that no
one, aside from the sender and the intended receiver, can even detect the
presence of the secret message. In this paper, we provide a new
provably-secure, private-key steganog... |
0909.4588 | Discrete MDL Predicts in Total Variation | math.PR cs.IT cs.LG math.IT math.ST stat.ML stat.TH | The Minimum Description Length (MDL) principle selects the model that has the
shortest code for data plus model. We show that for a countable class of
models, MDL predictions are close to the true distribution in a strong sense.
The result is completely general. No independence, ergodicity, stationarity,
identifiabil... |
0909.4589 | Cross-correlation properties of cyclotomic sequences | cs.IT cs.DM math.CO math.IT | Sequences with good correlation properties are widely used in engineering
applications, especially in the area of communications. Among the known
sequences, cyclotomic families have the optimal autocorrelation property. In
this paper, we decide the cross-correlation function of the known cyclotomic
sequences complete... |
0909.4592 | Autocorrelation-Run Formula for Binary Sequences | cs.IT cs.DM math.CO math.IT | The autocorrelation function and the run structure are two basic notions for
binary sequences, and have been used as two independent postulates to test
randomness of binary sequences ever since Golomb 1955. In this paper, we prove
for binary sequence that the autocorrelation function is in fact completely
determined ... |
0909.4601 | Rank Metric Decoder Architectures for Random Linear Network Coding with
Error Control | cs.IT math.IT | While random linear network coding is a powerful tool for disseminating
information in communication networks, it is highly susceptible to errors
caused by various sources. Due to error propagation, errors greatly deteriorate
the throughput of network coding and seriously undermine both reliability and
security of da... |
0909.4603 | Scalable Inference for Latent Dirichlet Allocation | cs.LG | We investigate the problem of learning a topic model - the well-known Latent
Dirichlet Allocation - in a distributed manner, using a cluster of C processors
and dividing the corpus to be learned equally among them. We propose a simple
approximated method that can be tuned, trading speed for accuracy according to
the ... |
0909.4604 | Interference Alignment for the $K$ User MIMO Interference Channel | cs.IT math.IT | We consider the $K$-user Multiple Input Multiple Output (MIMO) Gaussian
interference channel with $M$ antennas at each transmitter and $N$ antennas at
each receiver. It is assumed that channel coefficients are constant and are
available at all transmitters and at all receivers. The main objective of this
paper is to ... |
0909.4767 | Semidefinite programming, harmonic analysis and coding theory | cs.IT math.IT | These lecture notes where presented as a course of the CIMPA summer school in
Manila, July 20-30, 2009, Semidefinite programming in algebraic combinatorics.
This version is an update June 2010.
|
0909.4807 | Consensus in Correlated Random Topologies: Weights for Finite Time
Horizon | cs.IT math.IT | We consider the weight design problem for the consensus algorithm under a
finite time horizon. We assume that the underlying network is random where the
links fail at each iteration with certain probability and the link failures can
be spatially correlated. We formulate a family of weight design criteria
(objective f... |
0909.4808 | Combinatiorial Algorithms for Wireless Information Flow | cs.DS cs.IT math.IT | A long-standing open question in information theory is to characterize the
unicast capacity of a wireless relay network. The difficulty arises due to the
complex signal interactions induced in the network, since the wireless channel
inherently broadcasts the signals and there is interference among
transmissions. Rece... |
0909.4828 | Optimal Feedback Communication via Posterior Matching | cs.IT math.IT | In this paper we introduce a fundamental principle for optimal communication
over general memoryless channels in the presence of noiseless feedback, termed
posterior matching. Using this principle, we devise a (simple, sequential)
generic feedback transmission scheme suitable for a large class of memoryless
channels ... |
0909.4830 | Super-wavelets versus poly-Bergman spaces | math.FA cs.IT math.IT | Motivated by potential applications in multiplexing and by recent results on
Gabor analysis with Hermite windows due to Gr\"{o}chenig and Lyubarskii, we
investigate vector-valued wavelet transforms and vector-valued wavelet frames,
which constitute special cases of super-wavelets, with a particular attention
to the c... |
0909.4876 | A Program in Dialectical Rough Set Theory | math.LO cs.IT math.IT | A dialectical rough set theory focussed on the relation between roughly
equivalent objects and classical objects was introduced in \cite{AM699} by the
present author. The focus of our investigation is on elucidating the minimal
conditions on the nature of granularity, underlying semantic domain and nature
of the gene... |
0909.4889 | Hybrid Intrusion Detection and Prediction multiAgent System HIDPAS | cs.CR cs.AI cs.DS | This paper proposes an intrusion detection and prediction system based on
uncertain and imprecise inference networks and its implementation. Giving a
historic of sessions, it is about proposing a method of supervised learning
doubled of a classifier permitting to extract the necessary knowledge in order
to identify t... |
0909.4938 | Empirical analysis of web-based user-object bipartite networks | physics.data-an cs.IR physics.soc-ph | Understanding the structure and evolution of web-based user-object networks
is a significant task since they play a crucial role in e-commerce nowadays.
This Letter reports the empirical analysis on two large-scale web sites,
audioscrobbler.com and del.icio.us, where users are connected with music groups
and bookmark... |
0909.4983 | Event-Driven Optimal Feedback Control for Multi-Antenna Beamforming | cs.IT math.IT | Transmit beamforming is a simple multi-antenna technique for increasing
throughput and the transmission range of a wireless communication system. The
required feedback of channel state information (CSI) can potentially result in
excessive overhead especially for high mobility or many antennas. This work
concerns effi... |
0909.4995 | Geometrical Interpretation of Shannon's Entropy Based on the Born Rule | cs.IT cs.NE math.IT math.PR physics.data-an | In this paper we will analyze discrete probability distributions in which
probabilities of particular outcomes of some experiment (microstates) can be
represented by the ratio of natural numbers (in other words, probabilities are
represented by digital numbers of finite representation length). We will
introduce sever... |
0909.5000 | Eignets for function approximation on manifolds | cs.LG cs.NA cs.NE | Let $\XX$ be a compact, smooth, connected, Riemannian manifold without
boundary, $G:\XX\times\XX\to \RR$ be a kernel. Analogous to a radial basis
function network, an eignet is an expression of the form $\sum_{j=1}^M
a_jG(\circ,y_j)$, where $a_j\in\RR$, $y_j\in\XX$, $1\le j\le M$. We describe a
deterministic, univers... |
0909.5006 | On the Degrees of Freedom of the Compound MIMO Broadcast Channels with
Finite States | cs.IT math.IT | Multiple-antenna broadcast channels with $M$ transmit antennas and $K$
single-antenna receivers is considered, where the channel of receiver $r$ takes
one of the $J_r$ finite values. It is assumed that the channel states of each
receiver are randomly selected from $\mathds{R}^{M\times 1}$ (or from
$\mathds{C}^{M\time... |
0909.5007 | Achieving Capacity of Bi-Directional Tandem Collision Network by Joint
Medium-Access Control and Channel-Network Coding | cs.IT math.IT | In ALOHA-type packetized network, the transmission times of packets follow a
stochastic process. In this paper, we advocate a deterministic approach for
channel multiple-access. Each user is statically assigned a periodic protocol
signal, which takes value either zero or one, and transmit packets whenever the
value o... |
0909.5012 | IRPF90: a programming environment for high performance computing | cs.SE cs.CE | IRPF90 is a Fortran programming environment which helps the development of
large Fortran codes. In Fortran programs, the programmer has to focus on the
order of the instructions: before using a variable, the programmer has to be
sure that it has already been computed in all possible situations. For large
codes, it is... |
0909.5097 | On the Scope of the Universal-Algebraic Approach to Constraint
Satisfaction | cs.LO cs.AI cs.CC | The universal-algebraic approach has proved a powerful tool in the study of
the complexity of CSPs. This approach has previously been applied to the study
of CSPs with finite or (infinite) omega-categorical templates, and relies on
two facts. The first is that in finite or omega-categorical structures A, a
relation i... |
0909.5099 | Breaking Generator Symmetry | cs.AI cs.CC | Dealing with large numbers of symmetries is often problematic. One solution
is to focus on just symmetries that generate the symmetry group. Whilst there
are special cases where breaking just the symmetries in a generating set is
complete, there are also cases where no irredundant generating set eliminates
all symmet... |
0909.5119 | Random Access Transport Capacity | cs.IT math.IT | We develop a new metric for quantifying end-to-end throughput in multihop
wireless networks, which we term random access transport capacity, since the
interference model presumes uncoordinated transmissions. The metric quantifies
the average maximum rate of successful end-to-end transmissions, multiplied by
the commu... |
0909.5120 | Feedback-Based Collaborative Secrecy Encoding over Binary Symmetric
Channels | cs.IT cs.CR math.IT | In this paper we propose a feedback scheme for transmitting secret messages
between two legitimate parties, over an eavesdropped communication link.
Relative to Wyner's traditional encoding scheme \cite{wyner1}, our
feedback-based encoding often yields larger rate-equivocation regions and
achievable secrecy rates. Mo... |
0909.5166 | An Algorithm for Mining Multidimensional Fuzzy Association Rules | cs.IR cs.DB | Multidimensional association rule mining searches for interesting
relationship among the values from different dimensions or attributes in a
relational database. In this method the correlation is among set of dimensions
i.e., the items forming a rule come from different dimensions. Therefore each
dimension should be ... |
0909.5175 | Bounding the Sensitivity of Polynomial Threshold Functions | cs.CC cs.LG | We give the first non-trivial upper bounds on the average sensitivity and
noise sensitivity of polynomial threshold functions. More specifically, for a
Boolean function f on n variables equal to the sign of a real, multivariate
polynomial of total degree d we prove
1) The average sensitivity of f is at most O(n^{1-... |
0909.5179 | Expected RIP: Conditioning of The Modulated Wideband Converter | cs.IT math.IT | The sensing matrix of a compressive system impacts the stability of the
associated sparse recovery problem. In this paper, we study the sensing matrix
of the modulated wideband converter, a recently proposed system for sub-Nyquist
sampling of analog sparse signals. Attempting to quantify the conditioning of
the conve... |
0909.5216 | Learning Gaussian Tree Models: Analysis of Error Exponents and Extremal
Structures | stat.ML cs.IT math.IT math.ST stat.TH | The problem of learning tree-structured Gaussian graphical models from
independent and identically distributed (i.i.d.) samples is considered. The
influence of the tree structure and the parameters of the Gaussian distribution
on the learning rate as the number of samples increases is discussed.
Specifically, the err... |
0909.5268 | A Simple Necessary and Sufficient Condition for the Double Unicast
Problem | cs.IT math.IT | We consider a directed acyclic network where there are two source-terminal
pairs and the terminals need to receive the symbols generated at the respective
sources. Each source independently generates an i.i.d. random process over the
same alphabet. Each edge in the network is error-free, delay-free, and can
carry one... |
0909.5310 | Cognitive Power Control Under Correlated Fading and Primary-Link CSI | cs.IT math.IT | We consider the cognitive power control problem of maximizing the secondary
throughput under an outage probability constraint on a constant-power
constant-rate primary link. We assume a temporally correlated primary channel
with two types of feedback: perfect delayed channel state information (CSI) and
one-bit automa... |
0909.5424 | The Degrees of Freedom Regions of MIMO Broadcast, Interference, and
Cognitive Radio Channels with No CSIT | cs.IT math.IT | The degrees of freedom (DoF) regions are characterized for the multiple-input
multiple-output (MIMO) broadcast channel (BC), interference channels (IC)
(including X and multi-hop interference channels) and the cognitive radio
channel (CRC), when there is perfect and no channel state information at the
receivers and t... |
0909.5450 | Robust Distributed Estimation over Multiple Access Channels with
Constant Modulus Signaling | cs.IT math.IT | A distributed estimation scheme where the sensors transmit with constant
modulus signals over a multiple access channel is considered. The proposed
estimator is shown to be strongly consistent for any sensing noise distribution
in the i.i.d. case both for a per-sensor power constraint, and a total power
constraint. W... |
0909.5457 | Guaranteed Rank Minimization via Singular Value Projection | cs.LG cs.IT math.IT | Minimizing the rank of a matrix subject to affine constraints is a
fundamental problem with many important applications in machine learning and
statistics. In this paper we propose a simple and fast algorithm SVP (Singular
Value Projection) for rank minimization with affine constraints (ARMP) and show
that SVP recove... |
0909.5458 | Information tracking approach to segmentation of ultrasound imagery of
prostate | cs.CV | The size and geometry of the prostate are known to be pivotal quantities used
by clinicians to assess the condition of the gland during prostate cancer
screening. As an alternative to palpation, an increasing number of methods for
estimation of the above-mentioned quantities are based on using imagery data of
prostat... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.