id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1002.2780 | Collaborative Filtering in a Non-Uniform World: Learning with the
Weighted Trace Norm | cs.LG | We show that matrix completion with trace-norm regularization can be
significantly hurt when entries of the matrix are sampled non-uniformly. We
introduce a weighted version of the trace-norm regularizer that works well also
with non-uniform sampling. Our experimental results demonstrate that the
weighted trace-norm ... |
1002.2813 | Distributed Rate Allocation for Wireless Networks | cs.IT cs.NI math.IT | This paper develops a distributed algorithm for rate allocation in wireless
networks that achieves the same throughput region as optimal centralized
algorithms. This cross-layer algorithm jointly performs medium access control
(MAC) and physical-layer rate adaptation. The paper establishes that this
algorithm is thro... |
1002.2858 | PageRank: Standing on the shoulders of giants | cs.IR cs.DL | PageRank is a Web page ranking technique that has been a fundamental
ingredient in the development and success of the Google search engine. The
method is still one of the many signals that Google uses to determine which
pages are most important. The main idea behind PageRank is to determine the
importance of a Web pa... |
1002.2897 | Model-Driven Constraint Programming | cs.AI | Constraint programming can definitely be seen as a model-driven paradigm. The
users write programs for modeling problems. These programs are mapped to
executable models to calculate the solutions. This paper focuses on efficient
model management (definition and transformation). From this point of view, we
propose to ... |
1002.2928 | Reconstruction of signals with unknown spectra in information field
theory with parameter uncertainty | astro-ph.IM astro-ph.CO cs.IT math.IT physics.data-an stat.ME | The optimal reconstruction of cosmic metric perturbations and other signals
requires knowledge of their power spectra and other parameters. If these are
not known a priori, they have to be measured simultaneously from the same data
used for the signal reconstruction. We formulate the general problem of signal
inferen... |
1002.2959 | Geometric approach to sampling and communication | cs.IT cs.CV math.DG math.IT | Relationships that exist between the classical, Shannon-type, and
geometric-based approaches to sampling are investigated. Some aspects of coding
and communication through a Gaussian channel are considered. In particular, a
constructive method to determine the quantizing dimension in Zador's theorem is
provided. A ge... |
1002.2964 | Open vs Closed Access Femtocells in the Uplink | cs.IT math.IT | Femtocells are assuming an increasingly important role in the coverage and
capacity of cellular networks. In contrast to existing cellular systems,
femtocells are end-user deployed and controlled, randomly located, and rely on
third party backhaul (e.g. DSL or cable modem). Femtocells can be configured to
be either o... |
1002.2966 | Nonbinary Quantum Cyclic and Subsystem Codes Over
Asymmetrically-decohered Quantum Channels | cs.IT math.IT | Quantum computers theoretically are able to solve certain problems more
quickly than any deterministic or probabilistic computers. A quantum computer
exploits the rules of quantum mechanics to speed up computations. However, one
has to mitigate the resulting noise and decoherence effects to avoid
computational errors... |
1002.2971 | Erasure Multiple Descriptions | cs.IT math.IT | We consider a binary erasure version of the n-channel multiple descriptions
problem with symmetric descriptions, i.e., the rates of the n descriptions are
the same and the distortion constraint depends only on the number of messages
received. We consider the case where there is no excess rate for every k out of
n des... |
1002.3023 | Rewriting Constraint Models with Metamodels | cs.AI | An important challenge in constraint programming is to rewrite constraint
models into executable programs calculat- ing the solutions. This phase of
constraint processing may require translations between constraint programming
lan- guages, transformations of constraint representations, model
optimizations, and tuning... |
1002.3024 | Bounds for binary codes relative to pseudo-distances of k points | cs.IT math.IT | We apply Schrijver's semidefinite programming method to obtain improved upper
bounds on generalized distances and list decoding radii of binary codes.
|
1002.3047 | On the Non-Coherent Wideband Multipath Fading Relay Channel | cs.IT math.IT | We investigate the multipath fading relay channel in the limit of a large
bandwidth, and in the non-coherent setting, where the channel state is unknown
to all terminals, including the relay and the destination. We propose a
hypergraph model of the wideband multipath fading relay channel, and show that
its min-cut is... |
1002.3065 | Linear Capacity Scaling in Wireless Networks: Beyond Physical Limits? | cs.IT math.IT | We investigate the role of cooperation in wireless networks subject to a
spatial degrees of freedom limitation. To address the worst case scenario, we
consider a free-space line-of-sight type environment with no scattering and no
fading. We identify three qualitatively different operating regimes that are
determined ... |
1002.3078 | Using ATL to define advanced and flexible constraint model
transformations | cs.AI | Transforming constraint models is an important task in re- cent constraint
programming systems. User-understandable models are defined during the modeling
phase but rewriting or tuning them is manda- tory to get solving-efficient
models. We propose a new architecture al- lowing to define bridges between any
(modeling... |
1002.3086 | Convergence of Bayesian Control Rule | cs.AI cs.LG | Recently, new approaches to adaptive control have sought to reformulate the
problem as a minimization of a relative entropy criterion to obtain tractable
solutions. In particular, it has been shown that minimizing the expected
deviation from the causal input-output dependencies of the true plant leads to
a new promis... |
1002.3117 | LP Decoding of Regular LDPC Codes in Memoryless Channels | cs.IT math.IT | We study error bounds for linear programming decoding of regular LDPC codes.
For memoryless binary-input output-symmetric channels, we prove bounds on the
word error probability that are inverse doubly-exponential in the girth of the
factor graph. For memoryless binary-input AWGN channel, we prove lower bounds
on the... |
1002.3174 | A new approach to content-based file type detection | cs.LG cs.AI | File type identification and file type clustering may be difficult tasks that
have an increasingly importance in the field of computer and network security.
Classical methods of file type detection including considering file extensions
and magic bytes can be easily spoofed. Content-based file type detection is a
newe... |
1002.3183 | A Complete Characterization of Statistical Query Learning with
Applications to Evolvability | cs.CC cs.LG | Statistical query (SQ) learning model of Kearns (1993) is a natural
restriction of the PAC learning model in which a learning algorithm is allowed
to obtain estimates of statistical properties of the examples but cannot see
the examples themselves. We describe a new and simple characterization of the
query complexity... |
1002.3187 | On the scaling of Polar Codes: II. The behavior of un-polarized channels | cs.IT math.IT | We provide upper and lower bounds on the escape rate of the Bhattacharyya
process corresponding to polar codes and transmission over the the binary
erasure channel. More precisely, we bound the exponent of the number of
sub-channels whose Bhattacharyya constant falls in a fixed interval $[a,b]$.
Mathematically this c... |
1002.3188 | Noisy Network Coding | cs.IT math.IT | A noisy network coding scheme for sending multiple sources over a general
noisy network is presented. For multi-source multicast networks, the scheme
naturally extends both network coding over noiseless networks by Ahlswede, Cai,
Li, and Yeung, and compress-forward coding for the relay channel by Cover and
El Gamal t... |
1002.3192 | Study of Gaussian Relay Channels with Correlated Noises | cs.IT math.IT | In this paper, we consider full-duplex and half-duplex Gaussian relay
channels where the noises at the relay and destination are arbitrarily
correlated. We first derive the capacity upper bound and the achievable rates
with three existing schemes: Decode-and-Forward (DF), Compress-and-Forward
(CF), and Amplify-and-Fo... |
1002.3195 | Efficiently Discovering Hammock Paths from Induced Similarity Networks | cs.AI cs.DB | Similarity networks are important abstractions in many information management
applications such as recommender systems, corpora analysis, and medical
informatics. For instance, by inducing similarity networks between movies rated
similarly by users, or between documents containing common terms, and or
between clinica... |
1002.3234 | Improved subspace estimation for multivariate observations of high
dimension: the deterministic signals case | cs.IT math.IT | We consider the problem of subspace estimation in situations where the number
of available snapshots and the observation dimension are comparable in
magnitude. In this context, traditional subspace methods tend to fail because
the eigenvectors of the sample correlation matrix are heavily biased with
respect to the tr... |
1002.3238 | Exploring a Multidimensional Representation of Documents and Queries
(extended version) | cs.IR | In Information Retrieval (IR), whether implicitly or explicitly, queries and
documents are often represented as vectors. However, it may be more beneficial
to consider documents and/or queries as multidimensional objects. Our belief is
this would allow building "truly" interactive IR systems, i.e., where
interaction ... |
1002.3239 | Message-Passing Algorithms: Reparameterizations and Splittings | cs.IT cs.AI math.IT | The max-product algorithm, a local message-passing scheme that attempts to
compute the most probable assignment (MAP) of a given probability distribution,
has been successfully employed as a method of approximate inference for
applications arising in coding theory, computer vision, and machine learning.
However, the ... |
1002.3258 | Asymptotically Stable Walking of a Five-Link Underactuated 3D Bipedal
Robot | cs.RO | This paper presents three feedback controllers that achieve an asymptotically
stable, periodic, and fast walking gait for a 3D (spatial) bipedal robot
consisting of a torso, two legs, and passive (unactuated) point feet. The
contact between the robot and the walking surface is assumed to inhibit yaw
rotation. The stu... |
1002.3307 | Graph Zeta Function in the Bethe Free Energy and Loopy Belief
Propagation | cs.AI cs.DM math-ph math.MP | We propose a new approach to the analysis of Loopy Belief Propagation (LBP)
by establishing a formula that connects the Hessian of the Bethe free energy
with the edge zeta function. The formula has a number of theoretical
implications on LBP. It is applied to give a sufficient condition that the
Hessian of the Bethe ... |
1002.3312 | Multiuser Scheduling in a Markov-modeled Downlink using Randomly Delayed
ARQ Feedback | cs.IT cs.SY math.IT math.OC | We focus on the downlink of a cellular system, which corresponds to the bulk
of the data transfer in such wireless systems. We address the problem of
opportunistic multiuser scheduling under imperfect channel state information,
by exploiting the memory inherent in the channel. In our setting, the channel
between the ... |
1002.3320 | Co-channel Interference Cancellation for Space-Time Coded OFDM Systems
Using Adaptive Beamforming and Null Deepening | cs.CL | Combined with space-time coding, the orthogonal frequency division
multiplexing (OFDM) system explores space diversity. It is a potential scheme
to offer spectral efficiency and robust high data rate transmissions over
frequency-selective fading channel. However, space-time coding impairs the
system ability to suppre... |
1002.3342 | Spectral properties of the Google matrix of the World Wide Web and other
directed networks | cs.IR | We study numerically the spectrum and eigenstate properties of the Google
matrix of various examples of directed networks such as vocabulary networks of
dictionaries and university World Wide Web networks. The spectra have gapless
structure in the vicinity of the maximal eigenvalue for Google damping
parameter $\alph... |
1002.3344 | Iterative exact global histogram specification and SSIM gradient ascent:
a proof of convergence, step size and parameter selection | cs.CV cs.MM | The SSIM-optimized exact global histogram specification (EGHS) is shown to
converge in the sense that the first order approximation of the result's
quality (i.e., its structural similarity with input) does not decrease in an
iteration, when the step size is small. Each iteration is composed of SSIM
gradient ascent an... |
1002.3345 | Interactive Submodular Set Cover | cs.LG | We introduce a natural generalization of submodular set cover and exact
active learning with a finite hypothesis class (query learning). We call this
new problem interactive submodular set cover. Applications include advertising
in social networks with hidden information. We give an approximation guarantee
for a nove... |
1002.3356 | Uplink CoMP under a Constrained Backhaul and Imperfect Channel Knowledge | cs.IT math.IT | Coordinated Multi-Point (CoMP) is known to be a key technology for next
generation mobile communications systems, as it allows to overcome the burden
of inter-cell interference. Especially in the uplink, it is likely that
interference exploitation schemes will be used in the near future, as they can
be used with lega... |
1002.3449 | Minimizing weighted sum download time for one-to-many file transfer in
peer-to-peer networks | cs.IT cs.NI math.IT math.OC | This paper considers the problem of transferring a file from one source node
to multiple receivers in a peer-to-peer (P2P) network. The objective is to
minimize the weighted sum download time (WSDT) for the one-to-many file
transfer. Previous work has shown that, given an order at which the receivers
finish downloadi... |
1002.3493 | The Missing Piece Syndrome in Peer-to-Peer Communication | cs.PF cs.IT math.IT | Typical protocols for peer-to-peer file sharing over the Internet divide
files to be shared into pieces. New peers strive to obtain a complete
collection of pieces from other peers and from a seed. In this paper we
investigate a problem that can occur if the seeding rate is not large enough.
The problem is that, even... |
1002.3521 | Properties and Construction of Polar Codes | cs.IT math.IT | Recently, Ar{\i}kan introduced the method of channel polarization on which
one can construct efficient capacity-achieving codes, called polar codes, for
any binary discrete memoryless channel. In the thesis, we show that decoding
algorithm of polar codes, called successive cancellation decoding, can be
regarded as be... |
1002.3671 | Privacy-Preserving Protocols for Eigenvector Computation | cs.CR cs.DB | In this paper, we present a protocol for computing the principal eigenvector
of a collection of data matrices belonging to multiple semi-honest parties with
privacy constraints. Our proposed protocol is based on secure multi-party
computation with a semi-honest arbitrator who deals with data encrypted by the
other pa... |
1002.3724 | An Optimized Data Structure for High Throughput 3D Proteomics Data:
mzRTree | cs.CE cs.DS q-bio.QM | As an emerging field, MS-based proteomics still requires software tools for
efficiently storing and accessing experimental data. In this work, we focus on
the management of LC-MS data, which are typically made available in standard
XML-based portable formats. The structures that are currently employed to
manage these... |
1002.3770 | Extended Range Telepresence for Evacuation Training in Pedestrian
Simulations | cs.HC cs.MA | In this contribution, we propose a new framework to evaluate pedestrian
simula-tions by using Extended Range Telepresence. Telepresence is used as a
virtual reality walking simulator, which provides the user with a realistic
impression of being present and walking in a virtual environment that is much
larger than the... |
1002.3909 | Proposal new area of study by connecting between information theory and
Weber-Fechner law | cs.IT math.IT | Rough speaking, information theory deals with data transmitted over a channel
such as the internet. Modern information theory is generally considered to have
been founded in 1948 by Shannon in his seminal paper, "A mathematical theory of
communication." Shannon's formulation of information theory was an immediate
suc... |
1002.3931 | Competitive Spectrum Management with Incomplete Information | cs.IT cs.GT math.IT | This paper studies an interference interaction (game) between selfish and
independent wireless communication systems in the same frequency band. Each
system (player) has incomplete information about the other player's channel
conditions. A trivial Nash equilibrium point in this game is where players
mutually full spr... |
1002.3943 | Downlink Performance Analysis for a Generalized Shotgun Cellular System | cs.IT math.IT | In this paper, we analyze the signal-to-interference-plus-noise ratio (SINR)
performance at a mobile station (MS) in a random cellular network. The cellular
network is formed by base-stations (BSs) placed in a one, two or three
dimensional space according to a possibly non-homogeneous Poisson point
process, which is ... |
1002.3985 | Supervised Learning of Digital image restoration based on Quantization
Nearest Neighbor algorithm | cs.CV | In this paper, an algorithm is proposed for Image Restoration. Such algorithm
is different from the traditional approaches in this area, by utilizing priors
that are learned from similar images. Original images and their degraded
versions by the known degradation operators are utilized for designing the
Quantization.... |
1002.3990 | Static Address Generation Easing: a Design Methodology for Parallel
Interleaver Architectures | cs.AR cs.IT math.IT | For high throughput applications, turbo-like iterative decoders are
implemented with parallel architectures. However, to be efficient parallel
architectures require to avoid collision accesses i.e. concurrent read/write
accesses should not target the same memory block. This consideration applies to
the two main class... |
1002.4004 | Nature inspired artificial intelligence based adaptive traffic flow
distribution in computer network | cs.NE | Because of the stochastic nature of traffic requirement matrix, it is very
difficult to get the optimal traffic distribution to minimize the delay even
with adaptive routing protocol in a fixed connection network where capacity
already defined for each link. Hence there is a requirement to define such a
method, which... |
1002.4007 | Word level Script Identification from Bangla and Devanagri Handwritten
Texts mixed with Roman Script | cs.LG | India is a multi-lingual country where Roman script is often used alongside
different Indic scripts in a text document. To develop a script specific
handwritten Optical Character Recognition (OCR) system, it is therefore
necessary to identify the scripts of handwritten text correctly. In this paper,
we present a syst... |
1002.4014 | A fuzzified BRAIN algorithm for learning DNF from incomplete data | cs.IT cs.AI math.IT math.LO | Aim of this paper is to address the problem of learning Boolean functions
from training data with missing values. We present an extension of the BRAIN
algorithm, called U-BRAIN (Uncertainty-managing Batch Relevance-based
Artificial INtelligence), conceived for learning DNF Boolean formulas from
partial truth tables, ... |
1002.4019 | Query Learning with Exponential Query Costs | stat.ML cs.IT math.IT | In query learning, the goal is to identify an unknown object while minimizing
the number of "yes" or "no" questions (queries) posed about that object. A
well-studied algorithm for query learning is known as generalized binary search
(GBS). We show that GBS is a greedy algorithm to optimize the expected number
of quer... |
1002.4020 | Causal Markov condition for submodular information measures | cs.IT math.IT | The causal Markov condition (CMC) is a postulate that links observations to
causality. It describes the conditional independences among the observations
that are entailed by a causal hypothesis in terms of a directed acyclic graph.
In the conventional setting, the observations are random variables and the
independenc... |
1002.4022 | An Alternative Proof for the Capacity Region of the Degraded Gaussian
MIMO Broadcast Channel | cs.IT math.IT | We provide an alternative proof for the capacity region of the degraded
Gaussian multiple-input multiple-output (MIMO) broadcast channel. Our proof
does not use the channel enhancement technique as opposed to the original proof
of Weingertan {\it et. al.} and the alternative proof of Liu {\it et. al}. Our
proof start... |
1002.4040 | Handwritten Bangla Basic and Compound character recognition using MLP
and SVM classifier | cs.CV cs.LG | A novel approach for recognition of handwritten compound Bangla characters,
along with the Basic characters of Bangla alphabet, is presented here. Compared
to English like Roman script, one of the major stumbling blocks in Optical
Character Recognition (OCR) of handwritten Bangla script is the large number of
complex... |
1002.4041 | Improving Term Extraction Using Particle Swarm Optimization Techniques | cs.IR | Term extraction is one of the layers in the ontology development process
which has the task to extract all the terms contained in the input document
automatically. The purpose of this process is to generate list of terms that
are relevant to the domain of the input document. In the literature there are
many approache... |
1002.4046 | Supervised Classification Performance of Multispectral Images | cs.LG cs.CV | Nowadays government and private agencies use remote sensing imagery for a
wide range of applications from military applications to farm development. The
images may be a panchromatic, multispectral, hyperspectral or even
ultraspectral of terra bytes. Remote sensing image classification is one
amongst the most signific... |
1002.4048 | A Hough Transform based Technique for Text Segmentation | cs.IR | Text segmentation is an inherent part of an OCR system irrespective of the
domain of application of it. The OCR system contains a segmentation module
where the text lines, words and ultimately the characters must be segmented
properly for its successful recognition. The present work implements a Hough
transform based... |
1002.4058 | Contextual Bandit Algorithms with Supervised Learning Guarantees | cs.LG | We address the problem of learning in an online, bandit setting where the
learner must repeatedly select among $K$ actions, but only receives partial
feedback based on its choices. We establish two new facts: First, using a new
algorithm called Exp4.P, we show that it is possible to compete with the best
in a set of ... |
1002.4061 | Flux Analysis in Process Models via Causality | cs.CE cs.LO q-bio.QM | We present an approach for flux analysis in process algebra models of
biological systems. We perceive flux as the flow of resources in stochastic
simulations. We resort to an established correspondence between event
structures, a broadly recognised model of concurrency, and state transitions of
process models, seen a... |
1002.4062 | Modelling and Analysis of Biochemical Signalling Pathway Cross-talk | cs.CE q-bio.QM | Signalling pathways are abstractions that help life scientists structure the
coordination of cellular activity. Cross-talk between pathways accounts for
many of the complex behaviours exhibited by signalling pathways and is often
critical in producing the correct signal-response relationship. Formal models
of signall... |
1002.4063 | Investigating modularity in the analysis of process algebra models of
biochemical systems | cs.CE q-bio.QM | Compositionality is a key feature of process algebras which is often cited as
one of their advantages as a modelling technique. It is certainly true that in
biochemical systems, as in many other systems, model construction is made
easier in a formalism which allows the problem to be tackled compositionally.
In this p... |
1002.4064 | A flexible architecture for modeling and simulation of diffusional
association | cs.CE q-bio.QM | Up to now, it is not possible to obtain analytical solutions for complex
molecular association processes (e.g. Molecule recognition in Signaling or
catalysis). Instead Brownian Dynamics (BD) simulations are commonly used to
estimate the rate of diffusional association, e.g. to be later used in
mesoscopic simulations.... |
1002.4065 | BlenX-based compositional modeling of complex reaction mechanisms | cs.CE q-bio.QM | Molecular interactions are wired in a fascinating way resulting in complex
behavior of biological systems. Theoretical modeling provides a useful
framework for understanding the dynamics and the function of such networks. The
complexity of the biological networks calls for conceptual tools that manage
the combinatori... |
1002.4066 | Types for BioAmbients | cs.CE cs.LO q-bio.QM | The BioAmbients calculus is a process algebra suitable for representing
compartmentalization, molecular localization and movements between
compartments. In this paper we enrich this calculus with a static type system
classifying each ambient with group types specifying the kind of compartments
in which the ambient ca... |
1002.4067 | A Taxonomy of Causality-Based Biological Properties | cs.CE q-bio.QM | We formally characterize a set of causality-based properties of metabolic
networks. This set of properties aims at making precise several notions on the
production of metabolites, which are familiar in the biologists' terminology.
From a theoretical point of view, biochemical reactions are abstractly
represented as... |
1002.4088 | Additive Asymmetric Quantum Codes | cs.IT math.IT | We present a general construction of asymmetric quantum codes based on
additive codes under the trace Hermitian inner product. Various families of
additive codes over $\F_{4}$ are used in the construction of many asymmetric
quantum codes over $\F_{4}$.
|
1002.4180 | Design of a Smart Unmanned Ground Vehicle for Hazardous Environments | cs.RO cs.HC | A smart Unmanned Ground Vehicle (UGV) is designed and developed for some
application specific missions to operate predominantly in hazardous
environments. In our work, we have developed a small and lightweight vehicle to
operate in general cross-country terrains in or without daylight. The UGV can
send visual feedbac... |
1002.4263 | Precoding by Pairing Subchannels to Increase MIMO Capacity with Discrete
Input Alphabets | cs.IT math.IT | We consider Gaussian multiple-input multiple-output (MIMO) channels with
discrete input alphabets. We propose a non-diagonal precoder based on the
X-Codes in \cite{Xcodes_paper} to increase the mutual information. The MIMO
channel is transformed into a set of parallel subchannels using Singular Value
Decomposition (S... |
1002.4286 | Redundancy, Deduction Schemes, and Minimum-Size Bases for Association
Rules | cs.LO cs.AI | Association rules are among the most widely employed data analysis methods in
the field of Data Mining. An association rule is a form of partial implication
between two sets of binary variables. In the most common approach, association
rules are parameterized by a lower bound on their confidence, which is the
empiric... |
1002.4311 | Lowering the Error Floor of LDPC Codes Using Cyclic Liftings | cs.IT math.IT | Cyclic liftings are proposed to lower the error floor of low-density
parity-check (LDPC) codes. The liftings are designed to eliminate dominant
trapping sets of the base code by removing the short cycles which form the
trapping sets. We derive a necessary and sufficient condition for the cyclic
permutations assigned ... |
1002.4315 | Mining Statistically Significant Substrings Based on the Chi-Square
Measure | cs.DB | Given the vast reservoirs of data stored worldwide, efficient mining of data
from a large information store has emerged as a great challenge. Many databases
like that of intrusion detection systems, web-click records, player statistics,
texts, proteins etc., store strings or sequences. Searching for an unusual
patter... |
1002.4317 | CLD-shaped Brushstrokes in Non-Photorealistic Rendering | cs.CV cs.GR | Rendering techniques based on a random grid can be improved by adapting
brushstrokes to the shape of different areas of the original picture. In this
paper, the concept of Coherence Length Diagram is applied to determine the
adaptive brushstrokes, in order to simulate an impressionist painting. Some
examples are prov... |
1002.4453 | Nonparametric Estimation and On-Line Prediction for General Stationary
Ergodic Sources | cs.IT cs.AI math.IT math.PR | We proposed a learning algorithm for nonparametric estimation and on-line
prediction for general stationary ergodic sources. We prepare histograms each
of which estimates the probability as a finite distribution, and mixture them
with weights to construct an estimator. The whole analysis is based on measure
theory. T... |
1002.4458 | Approximate Sparsity Pattern Recovery: Information-Theoretic Lower
Bounds | cs.IT math.IT | Recovery of the sparsity pattern (or support) of an unknown sparse vector
from a small number of noisy linear measurements is an important problem in
compressed sensing. In this paper, the high-dimensional setting is considered.
It is shown that if the measurement rate and per-sample signal-to-noise ratio
(SNR) are f... |
1002.4470 | Large-System Analysis of Joint Channel and Data Estimation for MIMO
DS-CDMA Systems | cs.IT math.IT | This paper presents a large-system analysis of the performance of joint
channel estimation, multiuser detection, and per-user decoding (CE-MUDD) for
randomly-spread multiple-input multiple-output (MIMO) direct-sequence
code-division multiple-access (DS-CDMA) systems. A suboptimal receiver based on
successive decoding... |
1002.4473 | On Scaling Laws of Diversity Schemes in Decentralized Estimation | cs.IT math.IT | This paper is concerned with decentralized estimation of a Gaussian source
using multiple sensors. We consider a diversity scheme where only the sensor
with the best channel sends their measurements over a fading channel to a
fusion center, using the analog amplify and forwarding technique. The fusion
centre reconstr... |
1002.4510 | On linear $q$-ary completely regular codes with $\rho=2$ and dual
antipodal | cs.IT math.CO math.IT | We characterize all linear $q$-ary completely regular codes with covering
radius $\rho=2$ when the dual codes are antipodal. These completely regular
codes are extensions of linear completely regular codes with covering radius 1,
which are all classified. For $\rho=2$, we give a list of all such codes known
to us. Th... |
1002.4522 | Feature Importance in Bayesian Assessment of Newborn Brain Maturity from
EEG | cs.AI | The methodology of Bayesian Model Averaging (BMA) is applied for assessment
of newborn brain maturity from sleep EEG. In theory this methodology provides
the most accurate assessments of uncertainty in decisions. However, the
existing BMA techniques have been shown providing biased assessments in the
absence of some ... |
1002.4548 | Interference Alignment for the Multi-Antenna Compound Wiretap Channel | cs.IT cs.CR math.IT | We study a wiretap channel model where the sender has $M$ transmit antennas
and there are two groups consisting of $J_1$ and $J_2$ receivers respectively.
Each receiver has a single antenna. We consider two scenarios. First we
consider the compound wiretap model -- group 1 constitutes the set of
legitimate receivers,... |
1002.4587 | Using Information Semantic Systems for Absolutely Secure Processing | cs.IT math.IT | Propose a new cryptographic information concept. It allows : - to create
absolutely algorithmic unbreakable ciphers for communication through open
digital channels; - to create new code-breaking methods. They will be the most
efficient decoding methods to-date, with the help of which any of the existing
codes could, ... |
1002.4592 | Is It Real, or Is It Randomized?: A Financial Turing Test | q-fin.GN cs.CE cs.HC | We construct a financial "Turing test" to determine whether human subjects
can differentiate between actual vs. randomized financial returns. The
experiment consists of an online video-game (http://arora.ccs.neu.edu) where
players are challenged to distinguish actual financial market returns from
random temporal perm... |
1002.4658 | Principal Component Analysis with Contaminated Data: The High
Dimensional Case | stat.ML cs.LG stat.ME | We consider the dimensionality-reduction problem (finding a subspace
approximation of observed data) for contaminated data in the high dimensional
regime, where the number of observations is of the same magnitude as the number
of variables of each observation, and the data set contains some (arbitrarily)
corrupted ob... |
1002.4661 | Complementary approaches to understanding the plant circadian clock | cs.CE cs.MS q-bio.MN | Circadian clocks are oscillatory genetic networks that help organisms adapt
to the 24-hour day/night cycle. The clock of the green alga Ostreococcus tauri
is the simplest plant clock discovered so far. Its many advantages as an
experimental system facilitate the testing of computational predictions.
We present a mo... |
1002.4665 | Syntactic Topic Models | cs.CL cs.AI math.ST stat.TH | The syntactic topic model (STM) is a Bayesian nonparametric model of language
that discovers latent distributions of words (topics) that are both
semantically and syntactically coherent. The STM models dependency parsed
corpora where sentences are grouped into documents. It assumes that each word
is drawn from a late... |
1002.4759 | On the order bounds for one-point AG codes | cs.IT math.IT | The order bound for the minimum distance of algebraic geometry codes was
originally defined for the duals of one-point codes and later generalized for
arbitrary algebraic geometry codes. Another bound of order type for the minimum
distance of general linear codes, and for codes from order domains in
particular, was g... |
1002.4768 | Neural daylight control system | cs.NE nlin.AO | The paper describes the design, the implementation of a neural controller
used in an automatic daylight control system. The automatic lighting control
system (ALCS) attempt to maintain constant the illuminance at the desired level
on working plane even if the daylight contribution is variable. Therefore, the
daylight... |
1002.4802 | Gaussian Process Structural Equation Models with Latent Variables | cs.LG stat.ML | In a variety of disciplines such as social sciences, psychology, medicine and
economics, the recorded data are considered to be noisy measurements of latent
variables connected by some causal structure. This corresponds to a family of
graphical models known as the structural equation model with latent variables.
Whil... |
1002.4818 | A Trustability Metric for Code Search based on Developer Karma | cs.SE cs.IR | The promise of search-driven development is that developers will save time
and resources by reusing external code in their local projects. To efficiently
integrate this code, users must be able to trust it, thus trustability of code
search results is just as important as their relevance. In this paper, we
introduce a... |
1002.4820 | SLAM : Solutions lexicales automatique pour m\'etaphores | cs.CL | This article presents SLAM, an Automatic Solver for Lexical Metaphors like
?d\'eshabiller* une pomme? (to undress* an apple). SLAM calculates a
conventional solution for these productions. To carry on it, SLAM has to
intersect the paradigmatic axis of the metaphorical verb ?d\'eshabiller*?,
where ?peler? (?to peel?) ... |
1002.4831 | On Analysis and Evaluation of Multi-Sensory Cognitive Learning of a
Mathematical Topic Using Artificial Neural Networks | cs.NE | This piece of research belongs to the field of educational assessment issue
based upon the cognitive multimedia theory. Considering that theory; visual and
auditory material should be presented simultaneously to reinforce the retention
of a mathematical learned topic, a carefully computer-assisted learning (CAL)
modu... |
1002.4862 | Less Regret via Online Conditioning | cs.LG cs.AI | We analyze and evaluate an online gradient descent algorithm with adaptive
per-coordinate adjustment of learning rates. Our algorithm can be thought of as
an online version of batch gradient descent with a diagonal preconditioner.
This approach leads to regret bounds that are stronger than those of standard
online gr... |
1002.4907 | Twenty Questions Games Always End With Yes | cs.IT cs.DM math.IT | Huffman coding is often presented as the optimal solution to Twenty
Questions. However, a caveat is that Twenty Questions games always end with a
reply of "Yes," whereas Huffman codewords need not obey this constraint. We
bring resolution to this issue, and prove that the average number of questions
still lies betwee... |
1002.4908 | Adaptive Bound Optimization for Online Convex Optimization | cs.LG | We introduce a new online convex optimization algorithm that adaptively
chooses its regularization function based on the loss functions observed so
far. This is in contrast to previous algorithms that use a fixed regularization
function such as L2-squared, and modify it only via a single time-dependent
parameter. Our... |
1002.4919 | Proceedings Third Workshop From Biology To Concurrency and back | cs.CE cs.PL | This volume contains the papers presented at the 3rd Workshop "From Biology
To Concurrency and back", FBTC 2010, held in Paphos, Cyprus, on March 27, 2010,
as satellite event of the Joint European Conference on Theory and Practice of
Software, ETAPS 2010.
The Workshop aimed at gathering together researchers with sp... |
1002.4935 | Multiarray Signal Processing: Tensor decomposition meets compressed
sensing | math.NA cs.IT math.IT | We discuss how recently discovered techniques and tools from compressed
sensing can be used in tensor decompositions, with a view towards modeling
signals from multiple arrays of multiple sensors. We show that with appropriate
bounds on a measure of separation between radiating sources called coherence,
one could alw... |
1002.5026 | Capacity Region of Gaussian MIMO Broadcast Channels with Common and
Confidential Messages | cs.IT cs.CR math.IT | We study the two-user Gaussian multiple-input multiple-output (MIMO)
broadcast channel with common and confidential messages. In this channel, the
transmitter sends a common message to both users, and a confidential message to
each user which needs to be kept perfectly secret from the other user. We
obtain the entire... |
1003.0024 | Asymptotic Analysis of Generative Semi-Supervised Learning | cs.LG | Semisupervised learning has emerged as a popular framework for improving
modeling accuracy while controlling labeling cost. Based on an extension of
stochastic composite likelihood we quantify the asymptotic accuracy of
generative semi-supervised learning. In doing so, we complement
distribution-free analysis by prov... |
1003.0034 | A New Understanding of Prediction Markets Via No-Regret Learning | cs.AI cs.LG | We explore the striking mathematical connections that exist between market
scoring rules, cost function based prediction markets, and no-regret learning.
We show that any cost function based prediction market can be interpreted as an
algorithm for the commonly studied problem of learning from expert advice by
equatin... |
1003.0060 | Comment on "Fastest learning in small-world neural networks" | stat.ML cs.NE | This comment reexamines Simard et al.'s work in [D. Simard, L. Nadeau, H.
Kroger, Phys. Lett. A 336 (2005) 8-15]. We found that Simard et al. calculated
mistakenly the local connectivity lengths Dlocal of networks. The right results
of Dlocal are presented and the supervised learning performance of feedforward
neural... |
1003.0064 | Decoding by Sampling: A Randomized Lattice Algorithm for Bounded
Distance Decoding | cs.IT math.IT math.NT | Despite its reduced complexity, lattice reduction-aided decoding exhibits a
widening gap to maximum-likelihood (ML) performance as the dimension increases.
To improve its performance, this paper presents randomized lattice decoding
based on Klein's sampling technique, which is a randomized version of Babai's
nearest ... |
1003.0079 | Non-Sparse Regularization for Multiple Kernel Learning | cs.LG stat.ML | Learning linear combinations of multiple kernels is an appealing strategy
when the right choice of features is unknown. Previous approaches to multiple
kernel learning (MKL) promote sparse kernel combinations to support
interpretability and scalability. Unfortunately, this 1-norm MKL is rarely
observed to outperform ... |
1003.0090 | Random Access Game in Fading Channels with Capture: Equilibria and
Braess-like Paradoxes | cs.GT cs.IT math.IT | The Nash equilibrium point of the transmission probabilities in a slotted
ALOHA system with selfish nodes is analyzed. The system consists of a finite
number of heterogeneous nodes, each trying to minimize its average transmission
probability (or power investment) selfishly while meeting its average
throughput demand... |
1003.0093 | Joint Subcarrier Pairing and Power Allocation for OFDM Transmission with
Decode-and-Forward Relaying | cs.IT math.IT | In this paper, a point-to-point Orthogonal Frequency Division Multiplexing
(OFDM) system with a decode-and-forward (DF) relay is considered. The
transmission consists of two hops. The source transmits in the first hop, and
the relay transmits in the second hop. Each hop occupies one time slot. The
relay is half-duple... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.