id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1005.0608 | Informal Concepts in Machines | cs.AI | This paper constructively proves the existence of an effective procedure
generating a computable (total) function that is not contained in any given
effectively enumerable set of such functions. The proof implies the existence
of machines that process informal concepts such as computable (total) functions
beyond the ... |
1005.0616 | Tracking a Random Walk First-Passage Time Through Noisy Observations | math.ST cs.IT math.IT stat.TH | Given a Gaussian random walk (or a Wiener process), possibly with drift,
observed through noise, we consider the problem of estimating its first-passage
time $\tau_\ell$ of a given level $\ell$ with a stopping time $\eta$ defined
over the noisy observation process.
Main results are upper and lower bounds on the min... |
1005.0624 | The Gaussian Many-to-1 Interference Channel with Confidential Messages | cs.IT math.IT | The many-to-one interference channel has received interest by virtue of
embodying the essence of an interference network while being more tractable
than the general K-user interference channel. In this paper, we introduce
information theoretic secrecy to this model and consider the many-to-one
interference channel wi... |
1005.0662 | The B-Skip-List: A Simpler Uniquely Represented Alternative to B-Trees | cs.DS cs.DB | In previous work, the author introduced the B-treap, a uniquely represented
B-tree analogue, and proved strong performance guarantees for it. However, the
B-treap maintains complex invariants and is very complex to implement. In this
paper we introduce the B-skip-list, which has most of the guarantees of the
B-treap,... |
1005.0677 | The Enigma of CDMA Revisited | cs.IT math.IT | In this paper, we explore the mystery of synchronous CDMA as applied to
wireless and optical communication systems under very general settings for the
user symbols and the signature matrix entries. The channel is modeled with
real/complex additive noise of arbitrary distribution. Two problems are
addressed. The first... |
1005.0707 | The Production of Probabilistic Entropy in Structure/Action Contingency
Relations | cs.AI physics.soc-ph | Luhmann (1984) defined society as a communication system which is
structurally coupled to, but not an aggregate of, human action systems. The
communication system is then considered as self-organizing ("autopoietic"), as
are human actors. Communication systems can be studied by using Shannon's
(1948) mathematical the... |
1005.0732 | Outage rates and outage durations of opportunistic relaying systems | cs.IT math.IT | Opportunistic relaying is a simple yet efficient cooperation scheme that
achieves full diversity and preserves the spectral efficiency among the
spatially distributed stations. However, the stations' mobility causes temporal
correlation of the system's capacity outage events, which gives rise to its
important second-... |
1005.0734 | An efficient approximation to the correlated Nakagami-m sums and its
application in equal gain diversity receivers | cs.IT math.IT | There are several cases in wireless communications theory where the
statistics of the sum of independent or correlated Nakagami-m random variables
(RVs) is necessary to be known. However, a closed-form solution to the
distribution of this sum does not exist when the number of constituent RVs
exceeds two, even for the... |
1005.0749 | Integrating multiple sources to answer questions in Algebraic Topology | cs.SC cs.AI cs.HC | We present in this paper an evolution of a tool from a user interface for a
concrete Computer Algebra system for Algebraic Topology (the Kenzo system), to
a front-end allowing the interoperability among different sources for
computation and deduction. The architecture allows the system not only to
interface several s... |
1005.0766 | Learning High-Dimensional Markov Forest Distributions: Analysis of Error
Rates | cs.IT math.IT stat.ML | The problem of learning forest-structured discrete graphical models from
i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu
tree through adaptive thresholding is proposed. It is shown that this algorithm
is both structurally consistent and risk consistent and the error probability
of structur... |
1005.0794 | Active Learning for Hidden Attributes in Networks | stat.ML cond-mat.stat-mech cs.IT cs.LG math.IT physics.soc-ph | In many networks, vertices have hidden attributes, or types, that are
correlated with the networks topology. If the topology is known but these
attributes are not, and if learning the attributes is costly, we need a method
for choosing which vertex to query in order to learn as much as possible about
the attributes o... |
1005.0813 | TSDS: high-performance merge, subset, and filter software for time
series-like data | cs.DB | Time Series Data Server (TSDS) is a software package for implementing a
server that provides fast super-setting, sub-setting, filtering, and uniform
gridding of time series-like data. TSDS was developed to respond quickly to
requests for long time spans of data. Data may be served from a fast database,
typically crea... |
1005.0826 | Clustering processes | cs.LG cs.IT math.IT stat.ML | The problem of clustering is considered, for the case when each data point is
a sample generated by a stationary ergodic process. We propose a very natural
asymptotic notion of consistency, and show that simple consistent algorithms
exist, under most general non-parametric assumptions. The notion of consistency
is as... |
1005.0855 | On Capacity Scaling of Underwater Networks: An Information-Theoretic
Perspective | cs.IT math.IT | Capacity scaling laws are analyzed in an underwater acoustic network with $n$
regularly located nodes on a square. A narrow-band model is assumed where the
carrier frequency is allowed to scale as a function of $n$. In the network, we
characterize an attenuation parameter that depends on the frequency scaling as
well... |
1005.0858 | Randomized hybrid linear modeling by local best-fit flats | cs.CV | The hybrid linear modeling problem is to identify a set of d-dimensional
affine sets in a D-dimensional Euclidean space. It arises, for example, in
object tracking and structure from motion. The hybrid linear model can be
considered as the second simplest (behind linear) manifold model of data. In
this paper we will ... |
1005.0879 | From Skew-Cyclic Codes to Asymmetric Quantum Codes | cs.IT math.IT | We introduce an additive but not $\mathbb{F}_4$-linear map $S$ from
$\mathbb{F}_4^{n}$ to $\mathbb{F}_4^{2n}$ and exhibit some of its interesting
structural properties. If $C$ is a linear $[n,k,d]_4$-code, then $S(C)$ is an
additive $(2n,2^{2k},2d)_4$-code. If $C$ is an additive cyclic code then $S(C)$
is an additive... |
1005.0896 | A two-step fusion process for multi-criteria decision applied to natural
hazards in mountains | cs.AI | Mountain river torrents and snow avalanches generate human and material
damages with dramatic consequences. Knowledge about natural phenomenona is
often lacking and expertise is required for decision and risk management
purposes using multi-disciplinary quantitative or qualitative approaches.
Expertise is considered ... |
1005.0897 | The Complex Gaussian Kernel LMS algorithm | cs.LG | Although the real reproducing kernels are used in an increasing number of
machine learning problems, complex kernels have not, yet, been used, in spite
of their potential interest in applications such as communications. In this
work, we focus our attention on the complex gaussian kernel and its possible
application i... |
1005.0902 | Extension of Wirtinger Calculus in RKH Spaces and the Complex Kernel LMS | cs.LG | Over the last decade, kernel methods for nonlinear processing have
successfully been used in the machine learning community. However, so far, the
emphasis has been on batch techniques. It is only recently, that online
adaptive techniques have been considered in the context of signal processing
tasks. To the best of o... |
1005.0907 | Multistage Hybrid Arabic/Indian Numeral OCR System | cs.CV | The use of OCR in postal services is not yet universal and there are still
many countries that process mail sorting manually. Automated Arabic/Indian
numeral Optical Character Recognition (OCR) systems for Postal services are
being used in some countries, but still there are errors during the mail
sorting process, th... |
1005.0917 | On Building a Knowledge Base for Stability Theory | cs.AI | A lot of mathematical knowledge has been formalized and stored in
repositories by now: different mathematical theorems and theories have been
taken into consideration and included in mathematical repositories.
Applications more distant from pure mathematics, however --- though based on
these theories --- often need m... |
1005.0945 | An Efficient Vein Pattern-based Recognition System | cs.CV | This paper presents an efficient human recognition system based on vein
pattern from the palma dorsa. A new absorption based technique has been
proposed to collect good quality images with the help of a low cost camera and
light source. The system automatically detects the region of interest from the
image and does t... |
1005.0957 | ECG Feature Extraction Techniques - A Survey Approach | cs.NE cs.AI physics.med-ph | ECG Feature Extraction plays a significant role in diagnosing most of the
cardiac diseases. One cardiac cycle in an ECG signal consists of the P-QRS-T
waves. This feature extraction scheme determines the amplitudes and intervals
in the ECG signal for subsequent analysis. The amplitudes and intervals value
of P-QRS-T ... |
1005.0961 | Performance Oriented Query Processing In GEO Based Location Search
Engines | cs.IR | Geographic location search engines allow users to constrain and order search
results in an intuitive manner by focusing a query on a particular geographic
region. Geographic search technology, also called location search, has recently
received significant interest from major search engine companies. Academic
research... |
1005.0965 | Artificial Neural Network based Diagnostic Model For Causes of Success
and Failures | cs.NE | In this paper an attempt has been made to identify most important human
resource factors and propose a diagnostic model based on the back-propagation
and connectionist model approaches of artificial neural network (ANN). The
focus of the study is on the mobile -communication industry of India. The ANN
based approach ... |
1005.0972 | Adaptive Tuning Algorithm for Performance tuning of Database Management
System | cs.DB | Performance tuning of Database Management Systems(DBMS) is both complex and
challenging as it involves identifying and altering several key performance
tuning parameters. The quality of tuning and the extent of performance
enhancement achieved greatly depends on the skill and experience of the
Database Administrator ... |
1005.1062 | Asymptotically Regular LDPC Codes with Linear Distance Growth and
Thresholds Close to Capacity | cs.IT math.IT | Families of "asymptotically regular" LDPC block code ensembles can be formed
by terminating (J,K)-regular protograph-based LDPC convolutional codes. By
varying the termination length, we obtain a large selection of LDPC block code
ensembles with varying code rates and substantially better iterative decoding
threshold... |
1005.1065 | New Families of LDPC Block Codes Formed by Terminating Irregular
Protograph-Based LDPC Convolutional Codes | cs.IT math.IT | In this paper, we present a method of constructing new families of LDPC block
code ensembles formed by terminating irregular protograph-based LDPC
convolutional codes. Using the accumulate-repeat-by-4-jagged-accumulate (AR4JA)
protograph as an example, a density evolution analysis for the binary erasure
channel shows... |
1005.1120 | Estimating small moments of data stream in nearly optimal space-time | cs.DS cs.LG | For each $p \in (0,2]$, we present a randomized algorithm that returns an
$\epsilon$-approximation of the $p$th frequency moment of a data stream $F_p =
\sum_{i = 1}^n \abs{f_i}^p$. The algorithm requires space $O(\epsilon^{-2} \log
(mM)(\log n))$ and processes each stream update using time $O((\log n) (\log
\epsilon... |
1005.1155 | Decentralized Estimation over Orthogonal Multiple-access Fading Channels
in Wireless Sensor Networks - Optimal and Suboptimal Estimators | cs.IT math.IT stat.ME | Optimal and suboptimal decentralized estimators in wireless sensor networks
(WSNs) over orthogonal multiple-access fading channels are studied in this
paper. Considering multiple-bit quantization before digital transmission, we
develop maximum likelihood estimators (MLEs) with both known and unknown
channel state inf... |
1005.1252 | Universal algorithms, mathematics of semirings and parallel computations | math.NA cs.DS cs.MS cs.NE | This is a survey paper on applications of mathematics of semirings to
numerical analysis and computing. Concepts of universal algorithm and generic
program are discussed. Relations between these concepts and mathematics of
semirings are examined. A very brief introduction to mathematics of semirings
(including idempo... |
1005.1284 | Approximately achieving Gaussian relay network capacity with lattice
codes | cs.IT math.IT | Recently, it has been shown that a quantize-map-and-forward scheme
approximately achieves (within a constant number of bits) the Gaussian relay
network capacity for arbitrary topologies. This was established using Gaussian
codebooks for transmission and random mappings at the relays. In this paper, we
show that the s... |
1005.1292 | Broadcast gossip averaging algorithms: interference and asymptotical
error in large networks | math.OC cs.SY | In this paper we study two related iterative randomized algorithms for
distributed computation of averages. The first one is the recently proposed
Broadcast Gossip Algorithm, in which at each iteration one randomly selected
node broadcasts its own state to its neighbors. The second algorithm is a novel
de-synchronize... |
1005.1339 | Coordination and Bargaining over the Gaussian Interference Channel | cs.IT math.IT | This work considers coordination and bargaining between two selfish users
over a Gaussian interference channel using game theory. The usual information
theoretic approach assumes full cooperation among users for codebook and rate
selection. In the scenario investigated here, each selfish user is willing to
coordinate... |
1005.1340 | Distribution of Cognitive Load in Web Search | cs.HC cs.IR | The search task and the system both affect the demand on cognitive resources
during information search. In some situations, the demands may become too high
for a person. This article has a three-fold goal. First, it presents and
critiques methods to measure cognitive load. Second, it explores the
distribution of load... |
1005.1349 | On Holant Theorem and Its Proof | cs.IT math.IT | Holographic algorithms are a recent breakthrough in computer science and has
found applications in information theory. This paper provides a proof to the
central component of holographic algorithms, namely, the Holant theorem.
Compared with previous works, the proof appears simpler and more direct. Along
the proof, w... |
1005.1364 | Cognitive Radio Transmission under QoS Constraints and Interference
Limitations | cs.IT math.IT | In this paper, the performance of cognitive transmission under quality of
service (QoS)constraints and interference limitations is studied. Cognitive
secondary users are assumed to initially perform sensing over multiple
frequency bands (or equivalently channels) to detect the activities of primary
users. Subsequentl... |
1005.1365 | Cooperative Sequential Spectrum Sensing Algorithms for OFDM | cs.IT math.IT | This paper considers the problem of spectrum sensing in cognitive radio
networks when the primary user employs Orthogonal Frequency Division
Multiplexing (OFDM). We develop cooperative sequential detection algorithms
based on energy detectors and the autocorrelation property of cyclic prefix
(CP) used in OFDM systems... |
1005.1369 | Simultaneous communication in noisy channels | cs.IT math.IT | A sender wishes to broadcast a message of length $n$ over an alphabet to $r$
users, where each user $i$, $1 \leq i \leq r$ should be able to receive one of
$m_i$ possible messages. The broadcast channel has noise for each of the users
(possibly different noise for different users), who cannot distinguish between
some... |
1005.1391 | Solution to the Counterfeit Coin Problem and its Generalization | cs.IT math.IT | This work deals with a classic problem: "Given a set of coins among which
there is a counterfeit coin of a different weight, find this counterfeit coin
using ordinary balance scales, with the minimum number of weighings possible,
and indicate whether it weighs less or more than the rest". The method proposed
here not... |
1005.1395 | Fractal Weyl law for Linux Kernel Architecture | cs.CE cond-mat.dis-nn nlin.CD physics.data-an | We study the properties of spectrum and eigenstates of the Google matrix of a
directed network formed by the procedure calls in the Linux Kernel. Our results
obtained for various versions of the Linux Kernel show that the spectrum is
characterized by the fractal Weyl law established recently for systems of
quantum ch... |
1005.1471 | Classification via Incoherent Subspaces | cs.CV | This article presents a new classification framework that can extract
individual features per class. The scheme is based on a model of incoherent
subspaces, each one associated to one class, and a model on how the elements in
a class are represented in this subspace. After the theoretical analysis an
alternate projec... |
1005.1475 | How to correctly prune tropical trees | cs.AI cs.DM cs.GT cs.SC | We present tropical games, a generalization of combinatorial min-max games
based on tropical algebras. Our model breaks the traditional symmetry of
rational zero-sum games where players have exactly opposed goals (min vs. max),
is more widely applicable than min-max and also supports a form of pruning,
despite it bei... |
1005.1516 | An Agent-based Simulation of the Effectiveness of Creative Leadership | cs.MA cs.NE cs.SI | This paper investigates the effectiveness of creative versus uncreative
leadership using EVOC, an agent-based model of cultural evolution. Each
iteration, each agent in the artificial society invents a new action, or
imitates a neighbor's action. Only the leader's actions can be imitated by all
other agents, referred... |
1005.1518 | Recognizability of Individual Creative Style Within and Across Domains:
Preliminary Studies | cs.AI | It is hypothesized that creativity arises from the self-mending capacity of
an internal model of the world, or worldview. The uniquely honed worldview of a
creative individual results in a distinctive style that is recognizable within
and across domains. It is further hypothesized that creativity is domaingeneral
in ... |
1005.1524 | Cumulative-Separable Codes | cs.IT math.IT | q-ary cumulative-separable $\Gamma(L,G^{(j)})$-codes $L=\{ \alpha \in
GF(q^{m}):G(\alpha )\neq 0 \}$ and $G^{(j)}(x)=G(x)^{j}, 1 \leq i\leq q$ are
considered. The relation between different codes from this class is
demonstrated. Improved boundaries of the minimum distance and dimension are
obtained.
|
1005.1545 | Improving Semi-Supervised Support Vector Machines Through Unlabeled
Instances Selection | cs.LG | Semi-supervised support vector machines (S3VMs) are a kind of popular
approaches which try to improve learning performance by exploiting unlabeled
data. Though S3VMs have been found helpful in many situations, they may
degenerate performance and the resultant generalization ability may be even
worse than using the la... |
1005.1560 | Computation using Noise-based Logic: Efficient String Verification over
a Slow Communication Channel | cs.IT math.IT physics.gen-ph | Utilizing the hyperspace of noise-based logic, we show two string
verification methods with low communication complexity. One of them is based on
continuum noise-based logic. The other one utilizes noise-based logic with
random telegraph signals where a mathematical analysis of the error probability
is also given. Th... |
1005.1567 | On The Power of Tree Projections: Structural Tractability of Enumerating
CSP Solutions | cs.AI cs.DB | The problem of deciding whether CSP instances admit solutions has been deeply
studied in the literature, and several structural tractability results have
been derived so far. However, constraint satisfaction comes in practice as a
computation problem where the focus is either on finding one solution, or on
enumeratin... |
1005.1594 | Channel State Feedback over the MIMO-MAC | cs.IT math.IT | We consider the problem of designing low latency and low complexity schemes
for channel state feedback over the MIMO-MAC (multiple-input multiple-output
multiple access channel). We develop a framework for analyzing this problem in
terms of minimizing the MSE distortion, and come up with separated
source-channel sche... |
1005.1625 | On Some Results Related to Napoleon's Configurations | math.MG cs.IT math.GM math.IT | The goal of this paper is to give a purely geometric proof of a theorem by
Branko Gr\"unbaum concerning configuration of triangles coming from the
classical Napoleon's theorem in planar Euclidean geometry.
|
1005.1634 | Interference Alignment in Regenerating Codes for Distributed Storage:
Necessity and Code Constructions | cs.IT cs.DC cs.NI math.IT | Regenerating codes are a class of recently developed codes for distributed
storage that, like Reed-Solomon codes, permit data recovery from any arbitrary
k of n nodes. However regenerating codes possess in addition, the ability to
repair a failed node by connecting to any arbitrary d nodes and downloading an
amount o... |
1005.1635 | The Approximate Capacity Region of the Gaussian Z-Interference Channel
with Conferencing Encoders | cs.IT math.IT | A two-user Gaussian Z-Interference Channel (GZIC) is considered, in which
encoders are connected through noiseless links with finite capacities. In this
setting, prior to each transmission block the encoders communicate with each
other over the cooperative links. The capacity region and the sum-capacity of
the channe... |
1005.1684 | On Macroscopic Complexity and Perceptual Coding | cs.IT cs.AI cs.MM cs.SD math.IT | The theoretical limits of 'lossy' data compression algorithms are considered.
The complexity of an object as seen by a macroscopic observer is the size of
the perceptual code which discards all information that can be lost without
altering the perception of the specified observer. The complexity of this
macroscopical... |
1005.1711 | On Design of Distributed Beamforming for Two-Way Relay Networks | cs.IT math.IT | We consider a two-way relay network, where two source nodes, S1 and S2,
exchange information through a cluster of relay nodes. The relay nodes receive
the sum signal from S1 and S2 in the first time slot. In the second time slot,
each relay node multiplies its received signal by a complex coefficient and
retransmits ... |
1005.1715 | Degrees of Freedom Region of a Class of Multi-source Gaussian Relay
Networks | cs.IT math.IT | We study a layered $K$-user $M$-hop Gaussian relay network consisting of
$K_m$ nodes in the $m^{\operatorname{th}}$ layer, where $M\geq2$ and
$K=K_1=K_{M+1}$. We observe that the time-varying nature of wireless channels
or fading can be exploited to mitigate the inter-user interference. The
proposed amplify-and-forwa... |
1005.1716 | Heuristics in Conflict Resolution | cs.AI cs.LO | Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming
(ASP) are based on sophisticated Boolean constraint solving techniques. In both
areas, conflict-driven learning and related techniques constitute key features
whose application is enabled by conflict analysis. Although various conflict
analysi... |
1005.1785 | Sidelobe Suppression for Robust Beamformer via The Mixed Norm Constraint | cs.IT math.IT | Applying a sparse constraint on the beam pattern has been suggested to
suppress the sidelobe of the minimum variance distortionless response (MVDR)
beamformer recently. To further improve the performance, we add a mixed norm
constraint on the beam pattern. It matches the beam pattern better and
encourages dense distr... |
1005.1800 | Power-Efficient Ultra-Wideband Waveform Design Considering Radio Channel
Effects | cs.IT math.IT | This paper presents a power-efficient mask-constrained ultra-wideband (UWB)
waveform design with radio channel effects taken into consideration. Based on a
finite impulse response (FIR) filter, we develop a convex optimization model
with respect to the autocorrelation of the filter coefficients to optimize the
transm... |
1005.1801 | Sparse Support Recovery with Phase-Only Measurements | cs.IT math.IT math.NA | Sparse support recovery (SSR) is an important part of the compressive sensing
(CS). Most of the current SSR methods are with the full information
measurements. But in practice the amplitude part of the measurements may be
seriously destroyed. The corrupted measurements mismatch the current SSR
algorithms, which leads... |
1005.1803 | Anti-Sampling-Distortion Compressive Wideband Spectrum Sensing for
Cognitive Radio | cs.IT math.IT | Too high sampling rate is the bottleneck to wideband spectrum sensing for
cognitive radio in mobile communication. Compressed sensing (CS) is introduced
to transfer the sampling burden. The standard sparse signal recovery of CS does
not consider the distortion in the analogue-to-information converter (AIC). To
mitiga... |
1005.1804 | Compressive Wideband Spectrum Sensing for Fixed Frequency Spectrum
Allocation | cs.IT math.IT | Too high sampling rate is the bottleneck to wideband spectrum sensing for
cognitive radio (CR). As the survey shows that the sensed signal has a sparse
representation in frequency domain in the mass, compressed sensing (CS) can be
used to transfer the sampling burden to the digital signal processor. An analog
to info... |
1005.1853 | Lattice model refinement of protein structures | cs.CE physics.comp-ph q-bio.QM | To find the best lattice model representation of a given full atom protein
structure is a hard computational problem. Several greedy methods have been
suggested where results are usually biased and leave room for improvement. In
this paper we formulate and implement a Constraint Programming method to refine
such latt... |
1005.1860 | Feature Selection Using Regularization in Approximate Linear Programs
for Markov Decision Processes | cs.AI | Approximate dynamic programming has been used successfully in a large variety
of domains, but it relies on a small set of provided approximation features to
calculate solutions reliably. Large and rich sets of features can cause
existing algorithms to overfit because of a limited number of samples. We
address this sh... |
1005.1871 | Subfield-Subcodes of Generalized Toric codes | cs.IT math.IT | We study subfield-subcodes of Generalized Toric (GT) codes over
$\mathbb{F}_{p^s}$. These are the multidimensional analogues of BCH codes,
which may be seen as subfield-subcodes of generalized Reed-Solomon codes. We
identify polynomial generators for subfield-subcodes of GT codes which allows
us to determine the dime... |
1005.1918 | Prediction with Expert Advice under Discounted Loss | cs.LG | We study prediction with expert advice in the setting where the losses are
accumulated with some discounting---the impact of old losses may gradually
vanish. We generalize the Aggregating Algorithm and the Aggregating Algorithm
for Regression to this case, propose a suitable new variant of exponential
weights algorit... |
1005.1934 | Scalable Probabilistic Databases with Factor Graphs and MCMC | cs.DB cs.AI | Probabilistic databases play a crucial role in the management and
understanding of uncertain data. However, incorporating probabilities into the
semantics of incomplete databases has posed many challenges, forcing systems to
sacrifice modeling power, scalability, or restrict the class of relational
algebra formula un... |
1005.2012 | Dual Averaging for Distributed Optimization: Convergence Analysis and
Network Scaling | math.OC cs.SY stat.ML | The goal of decentralized optimization over a network is to optimize a global
objective formed by a sum of local (possibly nonsmooth) convex functions using
only local computation and communication. It arises in various application
domains, including distributed tracking and localization, multi-agent
co-ordination, e... |
1005.2061 | Cooperative Diversity with Mobile Nodes: Capacity Outage Rate and
Duration | cs.IT math.IT | The outage probability is an important performance measure for cooperative
diversity schemes. However, in mobile environments, the outage probability does
not completely describe the behavior of cooperative diversity schemes since the
mobility of the involved nodes introduces variations in the channel gains. As a
res... |
1005.2146 | On the Finite Time Convergence of Cyclic Coordinate Descent Methods | cs.LG cs.NA | Cyclic coordinate descent is a classic optimization method that has witnessed
a resurgence of interest in machine learning. Reasons for this include its
simplicity, speed and stability, as well as its competitive performance on
$\ell_1$ regularized smooth optimization problems. Surprisingly, very little is
known abou... |
1005.2179 | Detecting Blackholes and Volcanoes in Directed Networks | cs.LG | In this paper, we formulate a novel problem for finding blackhole and volcano
patterns in a large directed graph. Specifically, a blackhole pattern is a
group which is made of a set of nodes in a way such that there are only inlinks
to this group from the rest nodes in the graph. In contrast, a volcano pattern
is a g... |
1005.2243 | Robustness and Generalization | cs.LG | We derive generalization bounds for learning algorithms based on their
robustness: the property that if a testing sample is "similar" to a training
sample, then the testing error is close to the training error. This provides a
novel approach, different from the complexity or stability arguments, to study
generalizati... |
1005.2249 | Sparse Recovery with Orthogonal Matching Pursuit under RIP | cs.IT math.IT | This paper presents a new analysis for the orthogonal matching pursuit (OMP)
algorithm. It is shown that if the restricted isometry property (RIP) is
satisfied at sparsity level $O(\bar{k})$, then OMP can recover a
$\bar{k}$-sparse signal in 2-norm. For compressed sensing applications, this
result implies that in ord... |
1005.2251 | Interference Channel with a Half-Duplex Out-of-Band Relay | cs.IT math.IT | A Gaussian interference channel (IC) aided by a half-duplex relay is
considered, in which the relay receives and transmits in an orthogonal band
with respect to the IC. The system thus consists of two parallel channels, the
IC and the channel over which the relay is active, which is referred to as
Out-of-Band Relay C... |
1005.2254 | On Universal Complexity Measures | cs.IT cs.CC math.IT | We relate the computational complexity of finite strings to universal
representations of their underlying symmetries. First, Boolean functions are
classified using the universal covering topologies of the circuits which
enumerate them. A binary string is classified as a fixed point of its
automorphism group; the irre... |
1005.2263 | Context models on sequences of covers | stat.ML cs.LG | We present a class of models that, via a simple construction, enables exact,
incremental, non-parametric, polynomial-time, Bayesian inference of conditional
measures. The approach relies upon creating a sequence of covers on the
conditioning variable and maintaining a different model for each set within a
cover. Infe... |
1005.2267 | A Fast Compressive Channel Estimation with Modified Smoothed L0
Algorithm | cs.IT math.IT | Broadband wireless channel is a time dispersive and becomes strongly
frequency selective. In most cases, the channel is composed of a few dominant
coefficients and a large part of coefficients is approximately zero or zero. To
exploit the sparsity of multi-path channel (MPC), there are various methods
have been propo... |
1005.2269 | Sparse Multipath Channel Estimation using DS Algorithm in Wideband
Communication Systems | cs.IT cs.NI math.IT | Wideband wireless channel is a time dispersive channel and becomes strongly
frequency-selective. However, in most cases, the channel is composed of a few
dominant taps and a large part of taps is approximately zero or zero. They are
often called sparse multi-path channels (MPC). Conventional linear MPC methods,
such ... |
1005.2270 | Sparse Multipath Channel Estimation Using Compressive Sampling Matching
Pursuit Algorithm | cs.IT math.IT | Wideband wireless channel is a time dispersive channel and becomes strongly
frequency-selective. However, in most cases, the channel is composed of a few
dominant taps and a large part of taps is approximately zero or zero. To
exploit the sparsity of multi-path channel (MPC), two methods have been
proposed. They are,... |
1005.2296 | Online Learning of Noisy Data with Kernels | cs.LG | We study online learning when individual instances are corrupted by
adversarially chosen random noise. We assume the noise distribution is unknown,
and may change over time with no restriction other than having zero mean and
bounded variance. Our technique relies on a family of unbiased estimators for
non-linear func... |
1005.2303 | Towards Physarum Binary Adders | nlin.PS cs.AI physics.bio-ph q-bio.CB | Plasmodium of \emph{Physarum polycephalum} is a single cell visible by
unaided eye. The plasmodium's foraging behaviour is interpreted in terms of
computation. Input data is a configuration of nutrients, result of computation
is a network of plasmodium's cytoplasmic tubes spanning sources of nutrients.
Tsuda et al (2... |
1005.2308 | Finding Your Literature Match -- A Recommender System | cs.DL cs.IR | The universe of potentially interesting, searchable literature is expanding
continuously. Besides the normal expansion, there is an additional influx of
literature because of interdisciplinary boundaries becoming more and more
diffuse. Hence, the need for accurate, efficient and intelligent search tools
is bigger tha... |
1005.2321 | Typical Sequences for Polish Alphabets | cs.IT math.IT | The notion of typical sequences plays a key role in the theory of
information. Central to the idea of typicality is that a sequence $x_1, x_2,
..., x_n$ that is $P_X$-typical should, loosely speaking, have an empirical
distribution that is in some sense close to the distribution $P_X$. The two
most common notions of ... |
1005.2364 | A Short Introduction to Model Selection, Kolmogorov Complexity and
Minimum Description Length (MDL) | cs.LG cs.CC | The concept of overfitting in model selection is explained and demonstrated
with an example. After providing some background information on information
theory and Kolmogorov complexity, we provide a short explanation of Minimum
Description Length and error minimization. We conclude with a discussion of the
typical fe... |
1005.2443 | Network Coded Transmission of Fountain Codes over Cooperative Relay
Networks | cs.IT math.IT | In this paper, a transmission strategy of fountain codes over cooperative
relay networks is proposed. When more than one relay nodes are available, we
apply network coding to fountain-coded packets. By doing this, partial
information is made available to the destination node about the upcoming
message block. It is th... |
1005.2533 | Dynamics underlying Box-office: Movie Competition on Recommender Systems | physics.soc-ph cs.IR | We introduce a simple model to study movie competition in the recommender
systems. Movies of heterogeneous quality compete against each other through
viewers' reviews and generate interesting dynamics of box-office. By assuming
mean-field interactions between the competing movies, we show that run-away
effect of popu... |
1005.2544 | Channel Estimation for Opportunistic Spectrum Access: Uniform and Random
Sensing | cs.IT math.IT | The knowledge of channel statistics can be very helpful in making sound
opportunistic spectrum access decisions. It is therefore desirable to be able
to efficiently and accurately estimate channel statistics. In this paper we
study the problem of optimally placing sensing times over a time window so as
to get the bes... |
1005.2603 | Eigenvectors for clustering: Unipartite, bipartite, and directed graph
cases | cs.LG math.SP | This paper presents a concise tutorial on spectral clustering for broad
spectrum graphs which include unipartite (undirected) graph, bipartite graph,
and directed graph. We show how to transform bipartite graph and directed graph
into corresponding unipartite graph, therefore allowing a unified treatment to
all cases... |
1005.2613 | Compressed Sensing with Coherent and Redundant Dictionaries | math.NA cs.IT math.IT | This article presents novel results concerning the recovery of signals from
undersampled data in the common situation where such signals are not sparse in
an orthonormal basis or incoherent dictionary, but in a truly redundant
dictionary. This work thus bridges a gap in the literature and shows not only
that compress... |
1005.2633 | A Distributed Newton Method for Network Utility Maximization | math.OC cs.SY | Most existing work uses dual decomposition and subgradient methods to solve
Network Utility Maximization (NUM) problems in a distributed manner, which
suffer from slow rate of convergence properties. This work develops an
alternative distributed Newton-type fast converging algorithm for solving
network utility maximi... |
1005.2638 | Hierarchical Clustering for Finding Symmetries and Other Patterns in
Massive, High Dimensional Datasets | stat.ML cs.CV cs.LG | Data analysis and data mining are concerned with unsupervised pattern finding
and structure determination in data sets. "Structure" can be understood as
symmetry and a range of symmetries are expressed by hierarchy. Such symmetries
directly point to invariants, that pinpoint intrinsic properties of the data
and of th... |
1005.2646 | An Algebraic Approach to Physical-Layer Network Coding | cs.IT math.IT | The problem of designing new physical-layer network coding (PNC) schemes via
lattice partitions is considered. Building on a recent work by Nazer and
Gastpar, who demonstrated its asymptotic gain using information-theoretic
tools, we take an algebraic approach to show its potential in non-asymptotic
settings. We firs... |
1005.2662 | Fastest Distributed Consensus Averaging Problem on Perfect and Complete
n-ary Tree networks | cs.IT cs.DC cs.NI math.IT | Solving fastest distributed consensus averaging problem (i.e., finding
weights on the edges to minimize the second-largest eigenvalue modulus of the
weight matrix) over networks with different topologies is one of the primary
areas of research in the field of sensor networks and one of the well known
networks in this... |
1005.2704 | Characterizing and modeling the dynamics of online popularity | physics.soc-ph cs.CY cs.SI | Online popularity has enormous impact on opinions, culture, policy, and
profits. We provide a quantitative, large scale, temporal analysis of the
dynamics of online content popularity in two massive model systems, the
Wikipedia and an entire country's Web space. We find that the dynamics of
popularity are characteriz... |
1005.2710 | Capacity of a Class of Multicast Tree Networks | cs.IT math.IT | In this paper, we characterize the capacity of a new class of single-source
multicast discrete memoryless relay networks having a tree topology in which
the root node is the source and each parent node in the graph has at most one
noisy child node and any number of noiseless child nodes. This class of
multicast tree ... |
1005.2714 | Structural Drift: The Population Dynamics of Sequential Learning | q-bio.PE cs.LG | We introduce a theory of sequential causal inference in which learners in a
chain estimate a structural model from their upstream teacher and then pass
samples from the model to their downstream student. It extends the population
dynamics of genetic drift, recasting Kimura's selectively neutral theory as a
special ca... |
1005.2715 | On the Subspace of Image Gradient Orientations | cs.CV | We introduce the notion of Principal Component Analysis (PCA) of image
gradient orientations. As image data is typically noisy, but noise is
substantially different from Gaussian, traditional PCA of pixel intensities
very often fails to estimate reliably the low-dimensional subspace of a given
data population. We sho... |
1005.2731 | Cross-Band Interference Considered Harmful in OFDM Based Distributed
Spectrum Sharing | cs.IT math.IT | In the past few years we have witnessed the paradigm shift from static
spectrum allocation to dynamic spectrum access/sharing. Orthogonal
Frequency-Division Multiple Access (OFDMA) is a promising mechanism to
implement the agile spectrum access. However, in wireless distributed networks
where tight synchronization is... |
1005.2759 | Secrecy-Achieving Polar-Coding for Binary-Input Memoryless Symmetric
Wire-Tap Channels | cs.IT cs.CR math.IT | A polar coding scheme is introduced in this paper for the wire-tap channel.
It is shown that the provided scheme achieves the entire rate-equivocation
region for the case of symmetric and degraded wire-tap channel, where the weak
notion of secrecy is assumed. For the particular case of binary erasure
wire-tap channel... |
1005.2770 | Capacity-Achieving Polar Codes for Arbitrarily-Permuted Parallel
Channels | cs.IT math.IT | Channel coding over arbitrarily-permuted parallel channels was first studied
by Willems et al. (2008). This paper introduces capacity-achieving polar coding
schemes for arbitrarily-permuted parallel channels where the component channels
are memoryless, binary-input and output-symmetric.
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.