id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0903.1150 | Stochastic Constraint Programming: A Scenario-Based Approach | cs.AI | To model combinatorial decision problems involving uncertainty and
probability, we introduce scenario based stochastic constraint programming.
Stochastic constraint programs contain both decision variables, which we can
set, and stochastic variables, which follow a discrete probability
distribution. We provide a sema... |
0903.1152 | Stochastic Constraint Programming | cs.AI | To model combinatorial decision problems involving uncertainty and
probability, we introduce stochastic constraint programming. Stochastic
constraint programs contain both decision variables (which we can set) and
stochastic variables (which follow a probability distribution). They combine
together the best features ... |
0903.1157 | Information Propagation Speed in Mobile and Delay Tolerant Networks | cs.IT cs.NI math.IT | The goal of this paper is to increase our understanding of the fundamental
performance limits of mobile and Delay Tolerant Networks (DTNs), where
end-to-end multi-hop paths may not exist and communication routes may only be
available through time and mobility. We use analytical tools to derive generic
theoretical upp... |
0903.1183 | Fast Cycle Frequency Domain Feature Detection for Cognitive Radio
Systems | cs.IT math.IT | In cognitive radio systems, one of the main requirements is to detect the
presence of the primary users' transmission, especially in weak signal cases.
Cyclostationary detection is always used to solve weak signal detection,
however, the computational complexity prevents it from wide usage. In this
paper, a fast cycl... |
0903.1337 | Efficient quantization for average consensus | math.OC cs.SY | This paper presents an algorithm which solves exponentially fast the average
consensus problem on strongly connected network of digital links. The algorithm
is based on an efficient zooming-in/zooming-out quantization scheme.
|
0903.1379 | Optimum Pilot Overhead in Wireless Communication: A Unified Treatment of
Continuous and Block-Fading Channels | cs.IT math.IT | The optimization of the pilot overhead in single-user wireless fading
channels is investigated, and the dependence of this overhead on various system
parameters of interest (e.g., fading rate, signal-to-noise ratio) is
quantified. The achievable pilot-based spectral efficiency is expanded with
respect to the fading r... |
0903.1389 | A Linear Programming Driven Genetic Algorithm for Meta-Scheduling on
Utility Grids | cs.DC cs.NE | The user-level brokers in grids consider individual application QoS
requirements and minimize their cost without considering demands from other
users. This results in contention for resources and sub-optimal schedules.
Meta-scheduling in grids aims to address this scheduling problem, which is NP
hard due to its combi... |
0903.1443 | Dynamic Updating for L1 Minimization | cs.IT math.IT | The theory of compressive sensing (CS) suggests that under certain
conditions, a sparse signal can be recovered from a small number of linear
incoherent measurements. An effective class of reconstruction algorithms
involve solving a convex optimization program that balances the L1 norm of the
solution against a data ... |
0903.1448 | The Digital Restoration of Da Vinci's Sketches | cs.CV cs.GR | A sketch, found in one of Leonardo da Vinci's notebooks and covered by the
written notes of this genius, has been recently restored. The restoration
reveals a possible self-portrait of the artist, drawn when he was young. Here,
we discuss the discovery of this self-portrait and the procedure used for
restoration. Act... |
0903.1451 | Definition of evidence fusion rules on the basis of Referee Functions | cs.AI math.PR stat.AP | This chapter defines a new concept and framework for constructing fusion
rules for evidences. This framework is based on a referee function, which does
a decisional arbitrament conditionally to basic decisions provided by the
several sources of information. A simple sampling method is derived from this
framework. The... |
0903.1476 | The Power of Convex Relaxation: Near-Optimal Matrix Completion | cs.IT math.IT | This paper is concerned with the problem of recovering an unknown matrix from
a small fraction of its entries. This is known as the matrix completion
problem, and comes up in a great number of applications, including the famous
Netflix Prize and other similar questions in collaborative filtering. In
general, accurate... |
0903.1484 | Physics of the Shannon Limits | cs.IT math.IT | We provide a simple physical interpretation, in the context of the second law
of thermodynamics, to the information inequality (a.k.a. the Gibbs' inequality,
which is also equivalent to the log-sum inequality), asserting that the
relative entropy between two probability distributions cannot be negative.
Since this in... |
0903.1496 | How Much Information can One Get from a Wireless Ad Hoc Sensor Network
over a Correlated Random Field? | cs.IT math.IT | New large deviations results that characterize the asymptotic information
rates for general $d$-dimensional ($d$-D) stationary Gaussian fields are
obtained. By applying the general results to sensor nodes on a two-dimensional
(2-D) lattice, the asymptotic behavior of ad hoc sensor networks deployed over
correlated ra... |
0903.1502 | Low-Density Graph Codes for slow fading Relay Channels | cs.IT math.IT | We study Low-Density Parity-Check (LDPC) codes with iterative decoding on
block-fading (BF) Relay Channels. We consider two users that employ coded
cooperation, a variant of decode-and-forward with a smaller outage probability
than the latter. An outage probability analysis for discrete constellations
shows that full... |
0903.1556 | Enumerative Encoding in the Grassmannian Space | cs.IT math.IT | Codes in the Grassmannian space have found recently application in network
coding. Representation of $k$-dimensional subspaces of $\F_q^n$ has generally
an essential role in solving coding problems in the Grassmannian, and in
particular in encoding subspaces of the Grassmannian. Different representations
of subspaces... |
0903.1588 | On the Growth Rate of the Weight Distribution of Irregular
Doubly-Generalized LDPC Codes | cs.IT math.IT | In this paper, an expression for the asymptotic growth rate of the number of
small linear-weight codewords of irregular doubly-generalized LDPC (D-GLDPC)
codes is derived. The expression is compact and generalizes existing results
for LDPC and generalized LDPC (GLDPC) codes. Ensembles with check or variable
node mini... |
0903.1621 | Susceptibility Propagation for Constraint Satisfaction Problems | cond-mat.dis-nn cond-mat.stat-mech cs.IT math.IT | We study the susceptibility propagation, a message-passing algorithm to
compute correlation functions. It is applied to constraint satisfaction
problems and its accuracy is examined. As a heuristic method to find a
satisfying assignment, we propose susceptibility-guided decimation where
correlations among the variabl... |
0903.1624 | Instanton-based Techniques for Analysis and Reduction of Error Floors of
LDPC Codes | cs.IT math.IT | We describe a family of instanton-based optimization methods developed
recently for the analysis of the error floors of low-density parity-check
(LDPC) codes. Instantons are the most probable configurations of the channel
noise which result in decoding failures. We show that the general idea and the
respective optimi... |
0903.1659 | Heuristic Reasoning on Graph and Game Complexity of Sudoku | cs.AI cs.GT cs.SC | The Sudoku puzzle has achieved worldwide popularity recently, and attracted
great attention of the computational intelligence community. Sudoku is always
considered as Satisfiability Problem or Constraint Satisfaction Problem. In
this paper, we propose to focus on the essential graph structure underlying the
Sudoku p... |
0903.1675 | A Simple Cooperative Transmission Protocol for Energy-Efficient
Broadcasting Over Multi-Hop Wireless Networks | cs.NI cs.IT math.IT | This paper analyzes a broadcasting technique for wireless multi-hop sensor
networks that uses a form of cooperative diversity called opportunistic large
arrays (OLAs). We propose a method for autonomous scheduling of the nodes,
which limits the nodes that relay and saves as much as 32% of the transmit
energy compared... |
0903.1680 | Faceted Exploration of Emerging Resource Spaces | cs.DB cs.DL cs.HC | Humans have the ability to regcognize the real world from different facets.
Faceted exploration is a mechanism for browsing and understanding large-scale
resources in information network by multiple facets. This paper proposes an
Emerging Resource Space Model, whose schema is a partially ordered set of
concepts with ... |
0903.1716 | Improved Lower Bounds on Capacities of Symmetric 2-Dimensional
Constraints using Rayleigh Quotients | cs.IT cs.DM math.CO math.IT | A method for computing lower bounds on capacities of 2-dimensional
constraints having a symmetric presentation in either the horizontal or the
vertical direction is presented. The method is a generalization of the method
of Calkin and Wilf (SIAM J. Discrete Math., 1998). Previous best lower bounds
on capacities of ce... |
0903.1724 | Folding, Tiling, and Multidimensional Coding | cs.IT math.IT | Folding a sequence $S$ into a multidimensional box is a method that is used
to construct multidimensional codes. The well known operation of folding is
generalized in a way that the sequence $S$ can be folded into various shapes.
The new definition of folding is based on lattice tiling and a direction in the
$D$-dime... |
0903.1765 | A Lower Bound on Arbitrary $f$--Divergences in Terms of the Total
Variation | math.PR cs.IT math.IT math.ST stat.TH | An important tool to quantify the likeness of two probability measures are
f-divergences, which have seen widespread application in statistics and
information theory. An example is the total variation, which plays an
exceptional role among the f-divergences. It is shown that every f-divergence
is bounded from below b... |
0903.1788 | The Role of Tag Suggestions in Folksonomies | cs.HC cs.IR | Most tagging systems support the user in the tag selection process by
providing tag suggestions, or recommendations, based on a popularity
measurement of tags other users provided when tagging the same resource. In
this paper we investigate the influence of tag suggestions on the emergence of
power law distributions ... |
0903.1820 | On the Capacity of Free-Space Optical Intensity Channels | cs.IT math.IT | New upper and lower bounds are presented on the capacity of the free-space
optical intensity channel. This channel is characterized by inputs that are
nonnegative (representing the transmitted optical intensity) and by outputs
that are corrupted by additive white Gaussian noise (because in free space the
disturbances... |
0903.1842 | Decay of Correlations for Sparse Graph Error Correcting Codes | cs.IT math.IT | The subject of this paper is transmission over a general class of
binary-input memoryless symmetric channels using error correcting codes based
on sparse graphs, namely low-density generator-matrix and low-density
parity-check codes. The optimal (or ideal) decoder based on the posterior
measure over the code bits, an... |
0903.1850 | Free actions and Grassmanian variety | math.AG cs.CV q-bio.NC | An algebraic notion of representational consistency is defined. A theorem
relating it to free actions is proved. A metrizability problem of the quotient
(a shape space) is discussed. This leads to a new algebraic variety with a
metrizability result. A concrete example is given from stereo vision.
|
0903.1878 | Contracting preference relations for database applications | cs.AI cs.DB | The binary relation framework has been shown to be applicable to many
real-life preference handling scenarios. Here we study preference contraction:
the problem of discarding selected preferences. We argue that the property of
minimality and the preservation of strict partial orders are crucial for
contractions. Cont... |
0903.1945 | Hessian and concavity of mutual information, differential entropy, and
entropy power in linear vector Gaussian channels | cs.IT math.IT | Within the framework of linear vector Gaussian channels with arbitrary
signaling, closed-form expressions for the Jacobian of the minimum mean square
error and Fisher information matrices with respect to arbitrary parameters of
the system are calculated in this paper. Capitalizing on prior research where
the minimum ... |
0903.1952 | Statistical Eigenmode Transmission over Jointly-Correlated MIMO Channels | cs.IT math.IT | We investigate MIMO eigenmode transmission using statistical channel state
information at the transmitter. We consider a general jointly-correlated MIMO
channel model, which does not require separable spatial correlations at the
transmitter and receiver. For this model, we first derive a closed-form tight
upper bound... |
0903.1953 | Laconic schema mappings: computing core universal solutions by means of
SQL queries | cs.DB | We present a new method for computing core universal solutions in data
exchange settings specified by source-to-target dependencies, by means of SQL
queries. Unlike previously known algorithms, which are recursive in nature, our
method can be implemented directly on top of any DBMS. Our method is based on
the new not... |
0903.1967 | Network error correction for unit-delay, memory-free networks using
convolutional codes | cs.IT math.IT | A single source network is said to be memory-free if all of the internal
nodes (those except the source and the sinks) do not employ memory but merely
send linear combinations of the symbols received at their incoming edges on
their outgoing edges. In this work, we introduce network-error correction for
single source... |
0903.1972 | On Competing Wireless Service Providers | cs.IT cs.GT math.IT | We consider a situation where wireless service providers compete for
heterogenous wireless users. The users differ in their willingness to pay as
well as in their individual channel gains. We prove existence and uniqueness of
the Nash equilibrium for the competition of two service providers, for a
generic channel mod... |
0903.2016 | Proof of a Conjecture on the Sequence of Exceptional Numbers,
Classifying Cyclic Codes and APN Functions | cs.IT math.AG math.IT | We prove a conjecture that classifies exceptional numbers. This conjecture
arises in two different ways, from cryptography and from coding theory. An odd
integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost
Perfect Nonlinear) over $\mathbb{F}_{2^n}$ for infinitely many values of $n$.
Equivalently,... |
0903.2158 | Supernodal Analysis Revisited | cs.SC cs.CE cs.DM | In this paper we show how to extend the known algorithm of nodal analysis in
such a way that, in the case of circuits without nullors and controlled sources
(but allowing for both, independent current and voltage sources), the system of
nodal equations describing the circuit is partitioned into one part, where the
no... |
0903.2174 | Game theory and the frequency selective interference channel - A
tutorial | cs.IT cs.GT math.IT | This paper provides a tutorial overview of game theoretic techniques used for
communication over frequency selective interference channels. We discuss both
competitive and cooperative techniques.
Keywords: Game theory, competitive games, cooperative games, Nash
Equilibrium, Nash bargaining solution, Generalized Nas... |
0903.2203 | Achievable Error Exponents for Channel with Side Information - Erasure
and List Decoding | cs.IT math.IT | We consider a decoder with an erasure option and a variable size list decoder
for channels with non-casual side information at the transmitter. First,
universally achievable error exponents are offered for decoding with an erasure
option using a parameterized decoder in the spirit of Csisz\'{a}r and
K\"{o}rner's deco... |
0903.2226 | On the achievable diversity-multiplexing tradeoff in interference
channels | cs.IT math.IT | We analyze two-user single-antenna fading interference channels with perfect
receive channel state information (CSI) and no transmit CSI. For the case of
very strong interference, we prove that decoding interference while treating
the intended signal as noise, subtracting the result out, and then decoding the
desired... |
0903.2232 | On the Iterative Decoding of High-Rate LDPC Codes With Applications in
Compressed Sensing | cs.IT math.IT | This paper considers the performance of $(j,k)$-regular low-density
parity-check (LDPC) codes with message-passing (MP) decoding algorithms in the
high-rate regime. In particular, we derive the high-rate scaling law for MP
decoding of LDPC codes on the binary erasure channel (BEC) and the $q$-ary
symmetric channel ($... |
0903.2243 | Pragmatic Information Rates, Generalizations of the Kelly Criterion, and
Financial Market Efficiency | cs.IT math.IT q-fin.PM q-fin.TR | This paper is part of an ongoing investigation of "pragmatic information",
defined in Weinberger (2002) as "the amount of information actually used in
making a decision". Because a study of information rates led to the Noiseless
and Noisy Coding Theorems, two of the most important results of Shannon's
theory, we begi... |
0903.2282 | Multiagent Learning in Large Anonymous Games | cs.MA cs.GT cs.LG | In large systems, it is important for agents to learn to act effectively, but
sophisticated multi-agent learning algorithms generally do not scale. An
alternative approach is to find restricted classes of games where simple,
efficient algorithms converge. It is shown that stage learning efficiently
converges to Nash ... |
0903.2299 | Differential Contrastive Divergence | cs.LG | This paper has been retracted.
|
0903.2310 | Analysis of the Relationships among Longest Common Subsequences,
Shortest Common Supersequences and Patterns and its application on Pattern
Discovery in Biological Sequences | cs.DS cs.DM cs.IR cs.OH q-bio.QM | For a set of mulitple sequences, their patterns,Longest Common Subsequences
(LCS) and Shortest Common Supersequences (SCS) represent different aspects of
these sequences profile, and they can all be used for biological sequence
comparisons and analysis. Revealing the relationship between the patterns and
LCS,SCS migh... |
0903.2315 | Design and Analysis of E2RC Codes | cs.IT cs.DM math.IT | We consider the design and analysis of the efficiently-encodable
rate-compatible ($E^2RC$) irregular LDPC codes proposed in previous work. In
this work we introduce semi-structured $E^2RC$-like codes and protograph
$E^2RC$ codes. EXIT chart based methods are developed for the design of
semi-structured $E^2RC$-like co... |
0903.2361 | Adaptive Observers and Parameter Estimation for a Class of Systems
Nonlinear in the Parameters | math.OC cs.SY math.DS q-bio.QM | We consider the problem of asymptotic reconstruction of the state and
parameter values in systems of ordinary differential equations. A solution to
this problem is proposed for a class of systems of which the unknowns are
allowed to be nonlinearly parameterized functions of state and time.
Reconstruction of state and... |
0903.2426 | Relay Selection and Power Allocation in Cooperative Cellular Networks | cs.IT math.IT | We consider a system with a single base station communicating with multiple
users over orthogonal channels while being assisted by multiple relays. Several
recent works have suggested that, in such a scenario, selection, i.e., a single
relay helping the source, is the best relaying option in terms of the resulting
co... |
0903.2448 | Positive Logic with Adjoint Modalities: Proof Theory, Semantics and
Reasoning about Information | cs.LO cs.MA | We consider a simple modal logic whose non-modal part has conjunction and
disjunction as connectives and whose modalities come in adjoint pairs, but are
not in general closure operators. Despite absence of negation and implication,
and of axioms corresponding to the characteristic axioms of (e.g.) T, S4 and
S5, such ... |
0903.2471 | Cooperative Multiplexing: Toward Higher Spectral Efficiency in
Multi-antenna Relay Networks | cs.IT math.IT | Previous work on cooperative communications has concentrated primarily on the
diversity benefits of such techniques. This paper, instead, considers the
multiplexing benefits of cooperative communications. First, a new
interpretation on the fundamental tradeoff between the transmission rate and
outage probability in m... |
0903.2516 | Effect of Degree Distribution on Evolutionary Search | cs.NE | This paper introduces a method to generate hierarchically modular networks
with prescribed node degree list and proposes a metric to measure network
modularity based on the notion of edge distance. The generated networks are
used as test problems to explore the effect of modularity and degree
distribution on evolutio... |
0903.2528 | Airport Gate Assignment A Hybrid Model and Implementation | cs.AI cs.OH | With the rapid development of airlines, airports today become much busier and
more complicated than previous days. During airlines daily operations,
assigning the available gates to the arriving aircrafts based on the fixed
schedule is a very important issue, which motivates researchers to study and
solve Airport Gat... |
0903.2543 | Multi-Agent Crisis Response systems - Design Requirements and Analysis
of Current Systems | cs.MA | Crisis response is a critical area of research, with encouraging progress in
the past view yeas. The aim of the research is to contribute to building future
crisis environment where software agents, robots, responders, crisis managers,
and crisis organizations interact to provide advice, protection and aid. This
pape... |
0903.2544 | To Click or not to Click? The Role of Contextualized and User-Centric
Web Snippets | cs.IR | When searching the web, it is often possible that there are too many results
available for ambiguous queries. Text snippets, extracted from the retrieved
pages, are an indicator of the pages' usefulness to the query intention and can
be used to focus the scope of search results. In this paper, we propose a novel
meth... |
0903.2641 | Multiscale Computations on Neural Networks: From the Individual Neuron
Interactions to the Macroscopic-Level Analysis | cs.CE cs.NA q-bio.NC | We show how the Equation-Free approach for multi-scale computations can be
exploited to systematically study the dynamics of neural interactions on a
random regular connected graph under a pairwise representation perspective.
Using an individual-based microscopic simulator as a black box coarse-grained
timestepper an... |
0903.2653 | Capacity region of the deterministic multi-pair bi-directional relay
network | cs.IT math.IT | In this paper we study the capacity region of the multi-pair bidirectional
(or two-way) wireless relay network, in which a relay node facilitates the
communication between multiple pairs of users. This network is a generalization
of the well known bidirectional relay channel, where we have only one pair of
users. We ... |
0903.2675 | Construction and Covering Properties of Constant-Dimension Codes | cs.IT math.IT | Constant-dimension codes (CDCs) have been investigated for noncoherent error
correction in random network coding. The maximum cardinality of CDCs with given
minimum distance and how to construct optimal CDCs are both open problems,
although CDCs obtained by lifting Gabidulin codes, referred to as KK codes, are
nearly... |
0903.2679 | Valuations and Metrics on Partially Ordered Sets | math.CO cs.IT math.IT | We extend the definitions of upper and lower valuations on partially ordered
sets, and consider the metrics they induce, in particular the metrics available
(or not) based on the logarithms of such valuations. Motivating applications in
computational linguistics and computational biology are indicated.
|
0903.2695 | Dynamic Multi-Vehicle Routing with Multiple Classes of Demands | cs.RO | In this paper we study a dynamic vehicle routing problem in which there are
multiple vehicles and multiple classes of demands. Demands of each class arrive
in the environment randomly over time and require a random amount of on-site
service that is characteristic of the class. To service a demand, one of the
vehicles... |
0903.2711 | Performance Assessment of MIMO-BICM Demodulators based on System
Capacity | cs.IT math.IT | We provide a comprehensive performance comparison of soft-output and
hard-output demodulators in the context of non-iterative multiple-input
multiple-output bit-interleaved coded modulation (MIMO-BICM). Coded bit error
rate (BER), widely used in literature for demodulator comparison, has the
drawback of depending str... |
0903.2749 | The Perfect Binary One-Error-Correcting Codes of Length 15: Part
II--Properties | cs.IT math.IT | A complete classification of the perfect binary one-error-correcting codes of
length 15 as well as their extensions of length 16 was recently carried out in
[P. R. J. \"Osterg{\aa}rd and O. Pottonen, "The perfect binary
one-error-correcting codes of length 15: Part I--Classification," IEEE Trans.
Inform. Theory vol. ... |
0903.2774 | Compressive estimation of doubly selective channels in multicarrier
systems: Leakage effects and sparsity-enhancing processing | cs.IT math.IT | We consider the application of compressed sensing (CS) to the estimation of
doubly selective channels within pulse-shaping multicarrier systems (which
include OFDM systems as a special case). By exploiting sparsity in the
delay-Doppler domain, CS-based channel estimation allows for an increase in
spectral efficiency ... |
0903.2791 | On the Hamming weight of Repeated Root Cyclic and Negacyclic Codes over
Galois Rings | cs.IT math.IT | Repeated root Cyclic and Negacyclic codes over Galois rings have been studied
much less than their simple root counterparts. This situation is beginning to
change. For example, repeated root codes of length $p^s$, where $p$ is the
characteristic of the alphabet ring, have been studied under some additional
hypotheses... |
0903.2792 | Thermodynamics of Information Retrieval | cs.IT cs.CL cs.SI math.IT | In this work, we suggest a parameterized statistical model (the gamma
distribution) for the frequency of word occurrences in long strings of English
text and use this model to build a corresponding thermodynamic picture by
constructing the partition function. We then use our partition function to
compute thermodynami... |
0903.2820 | Cooperative Transmission in a Wireless Relay Network based on Flow
Management | cs.IT math.IT | In this paper, a cooperative transmission design for a general multi-node
half-duplex wireless relay network is presented. It is assumed that the nodes
operate in half-duplex mode and that channel information is available at the
nodes. The proposed design involves solving a convex flow optimization problem
on a graph... |
0903.2851 | A parameter-free hedging algorithm | cs.LG cs.AI | We study the problem of decision-theoretic online learning (DTOL). Motivated
by practical applications, we focus on DTOL when the number of actions is very
large. Previous algorithms for learning in this framework have a tunable
learning rate parameter, and a barrier to using online-learning in practical
applications... |
0903.2862 | Tracking using explanation-based modeling | cs.LG cs.AI cs.CV | We study the tracking problem, namely, estimating the hidden state of an
object over time, from unreliable and noisy measurements. The standard
framework for the tracking problem is the generative framework, which is the
basis of solutions such as the Bayesian algorithm and its approximation, the
particle filters. Ho... |
0903.2870 | On $p$-adic Classification | cs.LG | A $p$-adic modification of the split-LBG classification method is presented
in which first clusterings and then cluster centers are computed which locally
minimise an energy function. The outcome for a fixed dataset is independent of
the prime number $p$ with finitely many exceptions. The methods are applied to
the c... |
0903.2890 | Kalman Filtering with Intermittent Observations: Weak Convergence to a
Stationary Distribution | cs.IT cs.LG math.IT math.ST stat.TH | The paper studies the asymptotic behavior of Random Algebraic Riccati
Equations (RARE) arising in Kalman filtering when the arrival of the
observations is described by a Bernoulli i.i.d. process. We model the RARE as
an order-preserving, strongly sublinear random dynamical system (RDS). Under a
sufficient condition, ... |
0903.2923 | On uncertainty principles in the finite dimensional setting | math.CA cs.IT math.IT | The aim of this paper is to prove an uncertainty principle for the
representation of a vector in two bases. Our result extends previously known
qualitative uncertainty principles into quantitative estimates. We then show
how to transfer this result to the discrete version of the Short Time Fourier
Transform. An appli... |
0903.2972 | Optimistic Simulated Exploration as an Incentive for Real Exploration | cs.LG cs.AI | Many reinforcement learning exploration techniques are overly optimistic and
try to explore every state. Such exploration is impossible in environments with
the unlimited number of states. I propose to use simulated exploration with an
optimistic model to discover promising paths for real exploration. This reduces
th... |
0903.3000 | A Robust Ranging Scheme for OFDMA-Based Networks | cs.IT math.IT | Uplink synchronization in orthogonal frequency-division multiple-access
(OFDMA) systems is a challenging task. In IEEE 802.16-based networks, users
that intend to establish a communication link with the base station must go
through a synchronization procedure called Initial Ranging (IR). Existing IR
schemes aim at es... |
0903.3004 | Decoding of MDP Convolutional Codes over the Erasure Channel | cs.IT math.IT | This paper studies the decoding capabilities of maximum distance profile
(MDP) convolutional codes over the erasure channel and compares them with the
decoding capabilities of MDS block codes over the same channel. The erasure
channel involving large alphabets is an important practical channel model when
studying pac... |
0903.3024 | A Vector Generalization of Costa's Entropy-Power Inequality with
Applications | cs.IT math.IT | This paper considers an entropy-power inequality (EPI) of Costa and presents
a natural vector generalization with a real positive semidefinite matrix
parameter. This new inequality is proved using a perturbation approach via a
fundamental relationship between the derivative of mutual information and the
minimum mean-... |
0903.3072 | Spatial Skyline Queries: An Efficient Geometric Algorithm | cs.DB cs.CG | As more data-intensive applications emerge, advanced retrieval semantics,
such as ranking or skylines, have attracted attention. Geographic information
systems are such an application with massive spatial data. Our goal is to
efficiently support skyline queries over massive spatial data. To achieve this
goal, we firs... |
0903.3096 | The Secrecy Capacity Region of the Gaussian MIMO Multi-receiver Wiretap
Channel | cs.IT math.IT | In this paper, we consider the Gaussian multiple-input multiple-output (MIMO)
multi-receiver wiretap channel in which a transmitter wants to have
confidential communication with an arbitrary number of users in the presence of
an external eavesdropper. We derive the secrecy capacity region of this channel
for the most... |
0903.3103 | Efficiently Learning a Detection Cascade with Sparse Eigenvectors | cs.MM cs.AI cs.LG | In this work, we first show that feature selection methods other than
boosting can also be used for training an efficient object detector. In
particular, we introduce Greedy Sparse Linear Discriminant Analysis (GSLDA)
\cite{Moghaddam2007Fast} for its conceptual simplicity and computational
efficiency; and slightly be... |
0903.3114 | Markov Random Field Segmentation of Brain MR Images | cs.CV cond-mat.stat-mech physics.data-an physics.med-ph | We describe a fully-automatic 3D-segmentation technique for brain MR images.
Using Markov random fields the segmentation algorithm captures three important
MR features, i.e. non-parametric distributions of tissue intensities,
neighborhood correlations and signal inhomogeneities. Detailed simulations and
real MR image... |
0903.3127 | Norm-Product Belief Propagation: Primal-Dual Message-Passing for
Approximate Inference | cs.AI cs.IT math.IT | In this paper we treat both forms of probabilistic inference, estimating
marginal probabilities of the joint distribution and finding the most probable
assignment, through a unified message-passing algorithm architecture. We
generalize the Belief Propagation (BP) algorithms of sum-product and
max-product and tree-rew... |
0903.3131 | Matrix Completion With Noise | cs.IT math.IT | On the heels of compressed sensing, a remarkable new field has very recently
emerged. This field addresses a broad range of problems of significant
practical interest, namely, the recovery of a data matrix from what appears to
be incomplete, and perhaps even corrupted, information. In its simplest form,
the problem i... |
0903.3204 | On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel | cs.IT math.IT | We consider the Additive White Gaussian Noise channel with Binary Phase Shift
Keying modulation. Our aim is to enable an algebraic hard decision Bounded
Minimum Distance decoder for a binary block code to exploit soft information
obtained from the demodulator. This idea goes back to Forney and is based on
treating re... |
0903.3257 | A New Local Distance-Based Outlier Detection Approach for Scattered
Real-World Data | cs.LG cs.IR | Detecting outliers which are grossly different from or inconsistent with the
remaining dataset is a major challenge in real-world KDD applications. Existing
outlier detection methods are ineffective on scattered real-world datasets due
to implicit data patterns and parameter setting issues. We define a novel
"Local D... |
0903.3261 | The Secrecy Capacity Region of the Gaussian MIMO Broadcast Channel | cs.IT math.IT | In this paper, we consider a scenario where a source node wishes to broadcast
two confidential messages for two respective receivers via a Gaussian MIMO
broadcast channel. A wire-tapper also receives the transmitted signal via
another MIMO channel. First we assumed that the channels are degraded and the
wire-tapper h... |
0903.3317 | Discovering Matching Dependencies | cs.DB | The concept of matching dependencies (mds) is recently pro- posed for
specifying matching rules for object identification. Similar to the functional
dependencies (with conditions), mds can also be applied to various data quality
applications such as violation detection. In this paper, we study the problem
of discover... |
0903.3329 | Optimal Policies Search for Sensor Management | cs.LG stat.AP | This paper introduces a new approach to solve sensor management problems.
Classically sensor management problems can be well formalized as
Partially-Observed Markov Decision Processes (POMPD). The original approach
developped here consists in deriving the optimal parameterized policy based on
a stochastic gradient es... |
0903.3433 | Fixed point theorems on partial randomness | cs.IT cs.CC math.IT math.LO math.PR | In our former work [K. Tadaki, Local Proceedings of CiE 2008, pp.425-434,
2008], we developed a statistical mechanical interpretation of algorithmic
information theory by introducing the notion of thermodynamic quantities at
temperature T, such as free energy F(T), energy E(T), and statistical
mechanical entropy S(T)... |
0903.3480 | Worst case attacks against binary probabilistic traitor tracing codes | cs.IT cs.CR math.IT | An insightful view into the design of traitor tracing codes should
necessarily consider the worst case attacks that the colluders can lead. This
paper takes an information-theoretic point of view where the worst case attack
is defined as the collusion strategy minimizing the achievable rate of the
traitor tracing cod... |
0903.3487 | Sending a Bivariate Gaussian Source over a Gaussian MAC with Feedback | cs.IT math.IT | We study the power-versus-distortion trade-off for the transmission of a
memoryless bivariate Gaussian source over a two-to-one Gaussian multiple-access
channel with perfect causal feedback. In this problem, each of two separate
transmitters observes a different component of a memoryless bivariate Gaussian
source as ... |
0903.3537 | Optimization and Analysis of Distributed Averaging with Short Node
Memory | cs.DC cs.IT cs.MA math.IT | In this paper, we demonstrate, both theoretically and by numerical examples,
that adding a local prediction component to the update rule can significantly
improve the convergence rate of distributed averaging algorithms. We focus on
the case where the local predictor is a linear combination of the node's two
previous... |
0903.3623 | Matrix plots of reordered bistochastized transaction flow tables: A
United States intercounty migration example | physics.soc-ph cs.SI physics.data-an stat.AP | We present a number of variously rearranged matrix plots of the $3, 107
\times 3, 107$ 1995-2000 (asymmetric) intercounty migration table for the
United States, principally in its bistochasticized form (all 3,107 row and
column sums iteratively proportionally fitted to equal 1). In one set of plots,
the counties are ... |
0903.3624 | Distributed and Adaptive Algorithms for Vehicle Routing in a Stochastic
and Dynamic Environment | cs.RO | In this paper we present distributed and adaptive algorithms for motion
coordination of a group of m autonomous vehicles. The vehicles operate in a
convex environment with bounded velocity and must service demands whose time of
arrival, location and on-site service are stochastic; the objective is to
minimize the exp... |
0903.3627 | Statistical RIP and Semi-Circle Distribution of Incoherent Dictionaries | cs.IT cs.DM math.IT math.PR | In this paper we formulate and prove a statistical version of the Candes-Tao
restricted isometry property (SRIP for short) which holds in general for any
incoherent dictionary which is a disjoint union of orthonormal bases. In
addition, we prove that, under appropriate normalization, the eigenvalues of
the associated... |
0903.3667 | How random are a learner's mistakes? | cs.LG cs.IT math.IT math.PR | Given a random binary sequence $X^{(n)}$ of random variables, $X_{t},$
$t=1,2,...,n$, for instance, one that is generated by a Markov source (teacher)
of order $k^{*}$ (each state represented by $k^{*}$ bits). Assume that the
probability of the event $X_{t}=1$ is constant and denote it by $\beta$.
Consider a learner ... |
0903.3669 | Comment on "Language Trees and Zipping" arXiv:cond-mat/0108530 | cs.AI cs.IT math.IT | Every encoding has priori information if the encoding represents any semantic
information of the unverse or object. Encoding means mapping from the unverse
to the string or strings of digits. The semantic here is used in the
model-theoretic sense or denotation of the object. If encoding or strings of
symbols is the a... |
0903.3676 | Combinatorial Ricci Curvature and Laplacians for Image Processing | cs.CV cs.CG | A new Combinatorial Ricci curvature and Laplacian operators for grayscale
images are introduced and tested on 2D synthetic, natural and medical images.
Analogue formulae for voxels are also obtained. These notions are based upon
more general concepts developed by R. Forman. Further applications, in
particular a fitti... |
0903.3685 | Quasiperfect domination in triangular lattices | math.CO cs.IT math.IT | A vertex subset $S$ of a graph $G$ is a perfect (resp. quasiperfect)
dominating set in $G$ if each vertex $v$ of $G\setminus S$ is adjacent to only
one vertex ($d_v\in\{1,2\}$ vertices) of $S$. Perfect and quasiperfect
dominating sets in the regular tessellation graph of Schl\"afli symbol
$\{3,6\}$ and in its toroida... |
0903.3715 | Optimal sparse CDMA detection at high load | cs.IT math.IT | Balancing efficiency of bandwidth use and complexity of detection involves
choosing a suitable load for a multi-access channel. In the case of synchronous
CDMA, with random codes, it is possible to demonstrate the existence of a
threshold in the load beyond which there is an apparent jump in computational
complexity.... |
0903.3759 | GeoP2P: An adaptive peer-to-peer overlay for efficient search and update
of spatial information | cs.NI cs.DB cs.DC | This paper proposes a fully decentralized peer-to-peer overlay structure
GeoP2P, to facilitate geographic location based search and retrieval of
information. Certain limitations of centralized geographic indexes favor
peer-to-peer organization of the information, which, in addition to avoiding
performance bottleneck,... |
0903.3786 | Multiple-Input Multiple-Output Gaussian Broadcast Channels with
Confidential Messages | cs.IT cs.CR math.IT | This paper considers the problem of secret communication over a two-receiver
multiple-input multiple-output (MIMO) Gaussian broadcast channel. The
transmitter has two independent messages, each of which is intended for one of
the receivers but needs to be kept asymptotically perfectly secret from the
other. It is sho... |
0903.3889 | On generating independent random strings | cs.IT cs.CC math.IT | It is shown that from two strings that are partially random and independent
(in the sense of Kolmogorov complexity) it is possible to effectively construct
polynomially many strings that are random and pairwise independent. If the two
initial strings are random, then the above task can be performed in polynomial
time... |
0903.3926 | Designing a GUI for Proofs - Evaluation of an HCI Experiment | cs.AI | Often user interfaces of theorem proving systems focus on assisting
particularly trained and skilled users, i.e., proof experts. As a result, the
systems are difficult to use for non-expert users. This paper describes a paper
and pencil HCI experiment, in which (non-expert) students were asked to make
suggestions for... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.