id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1004.4758 | A Design of Paraunitary Polyphase Matrices of Rational Filter Banks
Based on (P,Q) Shift-Invariant Systems | cs.IT math.IT | In this paper we present a method to design paraunitary polyphase matrices of
critically sampled rational filter banks. The method is based on (P,Q)
shift-invariant systems, and so any kind of rational splitting of the frequency
spectrum can be achieved using this method. Ideal (P,Q) shift-invariant system
with small... |
1004.4793 | Logical methods of object recognition on satellite images using spatial
constraints | cs.CV | A logical approach to object recognition on image is proposed. The main idea
of the approach is to perform the object recognition as a logical inference on
a set of rules describing an object shape.
|
1004.4801 | Ontology-based inference for causal explanation | cs.AI | We define an inference system to capture explanations based on causal
statements, using an ontology in the form of an IS-A hierarchy. We first
introduce a simple logical language which makes it possible to express that a
fact causes another fact and that a fact explains another fact. We present a
set of formal infere... |
1004.4815 | Universal A Posteriori Metrics Game | cs.IT math.IT math.PR | Over binary input channels, uniform distribution is a universal prior, in the
sense that it allows to maximize the worst case mutual information over all
binary input channels, ensuring at least 94.2% of the capacity. In this paper,
we address a similar question, but with respect to a universal generalized
linear dec... |
1004.4824 | Growth and structure of Slovenia's scientific collaboration network | physics.soc-ph cond-mat.stat-mech cs.DB | We study the evolution of Slovenia's scientific collaboration network from
1960 till present with a yearly resolution. For each year the network was
constructed from publication records of Slovene scientists, whereby two were
connected if, up to the given year inclusive, they have coauthored at least one
paper togeth... |
1004.4826 | Impact of Channel Asymmetry on Base Station Cooperative Transmission
with Limited Feedback | cs.IT math.IT | Base station (BS) cooperative transmission, also known as coordinated
multi-point transmission (CoMP), is an effective way to avoid inter-cell
interference in universal frequency reuse cellular systems. To gain the
promised benefit, however, huge feedback overhead is in demand to gather the
channel information. In th... |
1004.4830 | Performance Evaluation of SCM-WDM System Using Different Linecoding | cs.OH cs.IT math.IT | This paper investigates the theoretical performance analysis for a subcarrier
multiplexed (SCM) wavelength division multiplexing (WDM) optical transmission
system in presence of optical beat interference (OBI) which occurs during the
photo detection process. We have presented a comparison for improving the
performanc... |
1004.4848 | Punctuation effects in English and Esperanto texts | cs.CL physics.data-an | A statistical physics study of punctuation effects on sentence lengths is
presented for written texts: {\it Alice in wonderland} and {\it Through a
looking glass}. The translation of the first text into esperanto is also
considered as a test for the role of punctuation in defining a style, and for
contrasting natural... |
1004.4864 | Polynomial Learning of Distribution Families | cs.LG cs.DS | The question of polynomial learnability of probability distributions,
particularly Gaussian mixture distributions, has recently received significant
attention in theoretical computer science and machine learning. However,
despite major progress, the general question of polynomial learnability of
Gaussian mixture dist... |
1004.4880 | ECME Thresholding Methods for Sparse Signal Reconstruction | cs.IT math.IT | We propose a probabilistic framework for interpreting and developing hard
thresholding sparse signal reconstruction methods and present several new
algorithms based on this framework. The measurements follow an underdetermined
linear model, where the regression-coefficient vector is the sum of an unknown
deterministi... |
1004.4882 | Properties of Codes in the Johnson Scheme | cs.IT math.IT | Codes which attain the sphere packing bound are called perfect codes. The
most important metrics in coding theory on which perfect codes are defined are
the Hamming metric and the Johnson metric. While for the Hamming metric all
perfect codes over finite fields are known, in the Johnson metric it was
conjectured by D... |
1004.4917 | On the Capacity of Compound State-Dependent Channels with States Known
at the Transmitter | cs.IT math.IT math.PR | This paper investigates the capacity of compound state-dependent channels
with non-causal state information available at only the transmitter. A new
lower bound on the capacity of this class of channels is derived. This bound is
shown to be tight for the special case of compound channels with stochastic
degraded comp... |
1004.4944 | Outer Bounds for the Interference Channel with a Cognitive Relay | cs.IT math.IT | In this paper, we first present an outer bound for a general interference
channel with a cognitive relay, i.e., a relay that has non-causal knowledge of
both independent messages transmitted in the interference channel. This outer
bound reduces to the capacity region of the deterministic broadcast channel and
of the ... |
1004.4949 | Reed Muller Sensing Matrices and the LASSO | cs.IT math.IT | We construct two families of deterministic sensing matrices where the columns
are obtained by exponentiating codewords in the quaternary Delsarte-Goethals
code $DG(m,r)$. This method of construction results in sensing matrices with
low coherence and spectral norm. The first family, which we call
Delsarte-Goethals fra... |
1004.4965 | Many-to-Many Graph Matching: a Continuous Relaxation Approach | stat.ML cs.CV | Graphs provide an efficient tool for object representation in various
computer vision applications. Once graph-based representations are constructed,
an important question is how to compare graphs. This problem is often
formulated as a graph matching problem where one seeks a mapping between
vertices of two graphs wh... |
1004.4968 | On the Achievable Rate Regions for a Class of Cognitive Radio Channels:
Interference Channel with Degraded Message Sets with Unidirectional
Destination Cooperation | cs.IT math.IT | This paper considers the capacity gains due to unidirectional destination
cooperation in cognitive radio channels. We propose a novel channel,
interference channel with degraded message sets with unidirectional destination
cooperation (IC-DMS-UDC), to allow the receiver of cognitive radio (secondary
user) to particip... |
1004.5026 | Compressed Sensing: How sharp is the Restricted Isometry Property | cs.IT math.IT | Compressed Sensing (CS) seeks to recover an unknown vector with $N$ entries
by making far fewer than $N$ measurements; it posits that the number of
compressed sensing measurements should be comparable to the information content
of the vector, not simply $N$. CS combines the important task of compression
directly with... |
1004.5049 | The Burbea-Rao and Bhattacharyya centroids | cs.IT cs.CG math.IT | We study the centroid with respect to the class of information-theoretic
Burbea-Rao divergences that generalize the celebrated Jensen-Shannon divergence
by measuring the non-negative Jensen difference induced by a strictly convex
and differentiable function. Although those Burbea-Rao divergences are
symmetric by cons... |
1004.5051 | Tailored RF pulse optimization for magnetization inversion at ultra high
field | cs.CE cs.NE physics.med-ph | The radiofrequency (RF) transmit field is severely inhomogeneous at ultrahigh
field due to both RF penetration and RF coil design issues. This particularly
impairs image quality for sequences that use inversion pulses such as
magnetization prepared rapid acquisition gradient echo and limits the use of
quantitative ar... |
1004.5070 | Multichannel Sampling of Pulse Streams at the Rate of Innovation | cs.IT math.IT | We consider minimal-rate sampling schemes for infinite streams of delayed and
weighted versions of a known pulse shape. The minimal sampling rate for these
parametric signals is referred to as the rate of innovation and is equal to the
number of degrees of freedom per unit time. Although sampling of infinite pulse
st... |
1004.5071 | Dimensions of Formality: A Case Study for MKM in Software Engineering | cs.DL cs.AI cs.SE | We study the formalization of a collection of documents created for a
Software Engineering project from an MKM perspective. We analyze how document
and collection markup formats can cope with an open-ended, multi-dimensional
space of primary and secondary classifications and relationships. We show that
RDFa-based ext... |
1004.5094 | Fastest Distributed Consensus Problem on Branches of an Arbitrary
Connected Sensor Network | cs.IT cs.DC cs.DM math.IT | This paper studies the fastest distributed consensus averaging problem on
branches of an arbitrary connected sensor network. In the previous works full
knowledge about the sensor network's connectivity topology was required for
determining the optimal weights and convergence rate of distributed consensus
averaging al... |
1004.5108 | Analyzing Random Network Coding with Differential Equations and
Differential Inclusions | cs.IT cs.NI math.DS math.IT | We develop a framework based on differential equations (DE) and differential
inclusions (DI) for analyzing Random Network Coding (RNC), as well as a
nonlinear variant referred to as Random Coupon (RC), in a wireless network. The
DEDI framework serves as a powerful numerical and analytical tool to study RNC.
We demons... |
1004.5132 | The Two-User Deterministic Interference Channel with Rate-Limited
Feedback | cs.IT math.IT | In this paper we study the effect of rate-limited feedback on the sum-rate
capacity of the deterministic interference channel. We characterize the
sum-rate capacity of this channel in the symmetric case and show that having
feedback links can increase the sum-rate capacity by at most the rate of the
available feedbac... |
1004.5157 | Deriving Good LDPC Convolutional Codes from LDPC Block Codes | cs.IT math.IT | Low-density parity-check (LDPC) convolutional codes are capable of achieving
excellent performance with low encoding and decoding complexity. In this paper
we discuss several graph-cover-based methods for deriving families of
time-invariant and time-varying LDPC convolutional codes from LDPC block codes
and show how ... |
1004.5168 | Efficient and Effective Spam Filtering and Re-ranking for Large Web
Datasets | cs.IR | The TREC 2009 web ad hoc and relevance feedback tasks used a new document
collection, the ClueWeb09 dataset, which was crawled from the general Web in
early 2009. This dataset contains 1 billion web pages, a substantial fraction
of which are spam --- pages designed to deceive search engines so as to deliver
an unwant... |
1004.5181 | Analysis of Feedback Overhead for MIMO Beamforming over Time-Varying
Channels | cs.IT math.IT | In this paper, the required amount of feedback overhead for multiple-input
multiple-output (MIMO) beamforming over time-varying channels is presented in
terms of the entropy of the feedback messages. In the case that each transmit
antenna has its own power amplifier which has individual power limit, it has
been known... |
1004.5189 | Rate-distortion function via minimum mean square error estimation | cs.IT math.IT | We derive a simple general parametric representation of the rate-distortion
function of a memoryless source, where both the rate and the distortion are
given by integrals whose integrands include the minimum mean square error
(MMSE) of the distortion $\Delta=d(X,Y)$ based on the source symbol $X$, with
respect to a c... |
1004.5194 | 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... |
1004.5195 | On Perfect Codes in the Johnson Graph | cs.IT math.IT | In this paper we consider the existence of nontrivial perfect codes in the
Johnson graph J(n,w). We present combinatorial and number theory techniques to
provide necessary conditions for existence of such codes and reduce the range
of parameters in which 1-perfect and 2-perfect codes may exist.
|
1004.5214 | Split-Extended LDPC codes for coded cooperation | cs.IT math.IT | We propose a new code design that aims to distribute an LDPC code over a
relay channel. It is based on a split-and-extend approach, which allows the
relay to split the set of bits connected to some parity-check of the LDPC code
into two or several subsets. Subsequently, the sums of bits within each subset
are used in... |
1004.5215 | System Dynamics Modelling of the Processes Involving the Maintenance of
the Naive T Cell Repertoire | cs.AI q-bio.CB | The study of immune system aging, i.e. immunosenescence, is a relatively new
research topic. It deals with understanding the processes of immunodegradation
that indicate signs of functionality loss possibly leading to death. Even
though it is not possible to prevent immunosenescence, there is great benefit
in compreh... |
1004.5216 | Optimized puncturing distributions for irregular non-binary LDPC codes | cs.IT math.IT | In this paper we design non-uniform bit-wise puncturing distributions for
irregular non-binary LDPC (NB-LDPC) codes. The puncturing distributions are
optimized by minimizing the decoding threshold of the punctured LDPC code, the
threshold being computed with a Monte-Carlo implementation of Density
Evolution. First, w... |
1004.5217 | Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure
channel | cs.IT math.IT | In this paper, we show that Quasi-Cyclic LDPC codes can efficiently
accommodate the hybrid iterative/ML decoding over the binary erasure channel.
We demonstrate that the quasi-cyclic structure of the parity-check matrix can
be advantageously used in order to significantly reduce the complexity of the
ML decoding. Thi... |
1004.5222 | The Application of a Dendritic Cell Algorithm to a Robotic Classifier | cs.AI cs.NE cs.RO | The dendritic cell algorithm is an immune-inspired technique for processing
time-dependant data. Here we propose it as a possible solution for a robotic
classification problem. The dendritic cell algorithm is implemented on a real
robot and an investigation is performed into the effects of varying the
migration thres... |
1004.5229 | Optimism in Reinforcement Learning and Kullback-Leibler Divergence | cs.LG math.ST stat.ML stat.TH | We consider model-based reinforcement learning in finite Markov De- cision
Processes (MDPs), focussing on so-called optimistic strategies. In MDPs,
optimism can be implemented by carrying out extended value it- erations under a
constraint of consistency with the estimated model tran- sition probabilities.
The UCRL2 a... |
1004.5262 | On Application of the Local Search and the Genetic Algorithms Techniques
to Some Combinatorial Optimization Problems | cs.NE math.OC | In this paper the approach to solving several combinatorial optimization
problems using the local search and the genetic algorithm techniques is
proposed. Initially this approach was developed in purpose to overcome some
difficulties inhibiting the application of above mentioned techniques to the
problems of the Ques... |
1004.5274 | Robustness maximization of parallel multichannel systems | cs.IT math.IT | Bit error rate (BER) minimization and SNR-gap maximization, two robustness
optimization problems, are solved, under average power and bit-rate
constraints, according to the waterfilling policy. Under peak-power constraint
the solutions differ and this paper gives bit-loading solutions of both
robustness optimization ... |
1004.5305 | Compressed Sensing with off-axis frequency-shifting holography | physics.optics cs.CV physics.med-ph | This work reveals an experimental microscopy acquisition scheme successfully
combining Compressed Sensing (CS) and digital holography in off-axis and
frequency-shifting conditions. CS is a recent data acquisition theory involving
signal reconstruction from randomly undersampled measurements, exploiting the
fact that ... |
1004.5326 | Designing neural networks that process mean values of random variables | cond-mat.dis-nn cs.AI cs.LG | We introduce a class of neural networks derived from probabilistic models in
the form of Bayesian networks. By imposing additional assumptions about the
nature of the probabilistic models represented in the networks, we derive
neural networks with standard dynamics that require no training to determine
the synaptic w... |
1004.5339 | Query strategy for sequential ontology debugging | cs.LO cs.AI | Debugging of ontologies is an important prerequisite for their wide-spread
application, especially in areas that rely upon everyday users to create and
maintain knowledge bases, as in the case of the Semantic Web. Recent approaches
use diagnosis methods to identify causes of inconsistent or incoherent
ontologies. How... |
1004.5351 | Isometric Embeddings in Imaging and Vision: Facts and Fiction | cs.CV math.CV math.DG | We explore the practicability of Nash's Embedding Theorem in vision and
imaging sciences. In particular, we investigate the relevance of a result of
Burago and Zalgaller regarding the existence of isometric embeddings of
polyhedral surfaces in $\mathbb{R}^3$ and we show that their proof does not
extended directly to ... |
1004.5367 | Multiplicatively Repeated Non-Binary LDPC Codes | cs.IT math.IT | We propose non-binary LDPC codes concatenated with multiplicative repetition
codes. By multiplicatively repeating the (2,3)-regular non-binary LDPC mother
code of rate 1/3, we construct rate-compatible codes of lower rates 1/6, 1/9,
1/12,... Surprisingly, such simple low-rate non-binary LDPC codes outperform
the best... |
1004.5370 | Self-Taught Hashing for Fast Similarity Search | cs.IR | The ability of fast similarity search at large scale is of great importance
to many Information Retrieval (IR) applications. A promising way to accelerate
similarity search is semantic hashing which designs compact binary codes for a
large number of documents so that semantically similar documents are mapped to
simil... |
1004.5421 | Interference Mitigation through Limited Transmitter Cooperation | cs.IT math.IT | Interference limits performance in wireless networks, and cooperation among
receivers or transmitters can help mitigate interference by forming distributed
MIMO systems. Earlier work shows how limited receiver cooperation helps
mitigate interference. The scenario with transmitter cooperation, however, is
more difficu... |
1004.5424 | Graphic Symbol Recognition using Graph Based Signature and Bayesian
Network Classifier | cs.CV cs.GR | We present a new approach for recognition of complex graphic symbols in
technical documents. Graphic symbol recognition is a well known challenge in
the field of document image analysis and is at heart of most graphic
recognition systems. Our method uses structural approach for symbol
representation and statistical c... |
1004.5427 | Employing fuzzy intervals and loop-based methodology for designing
structural signature: an application to symbol recognition | cs.CV cs.GR | Motivation of our work is to present a new methodology for symbol
recognition. We support structural methods for representing visual associations
in graphic documents. The proposed method employs a structural approach for
symbol representation and a statistical classifier for recognition. We
vectorize a graphic symbo... |
1004.5429 | On Distance Properties of Quasi-Cyclic Protograph-Based LDPC Codes | cs.IT math.IT | Recent work has shown that properly designed protograph-based LDPC codes may
have minimum distance linearly increasing with block length. This notion rests
on ensemble arguments over all possible expansions of the base protograph. When
implementation complexity is considered, the expansion is typically chosen to
be q... |
1004.5442 | Multiple-Relaxation-Time Lattice Boltzmann Approach to Compressible
Flows with Flexible Specific-Heat Ratio and Prandtl Number | cond-mat.soft cs.CE nlin.CG physics.comp-ph physics.flu-dyn stat.CO | A new multiple-relaxation-time lattice Boltzmann scheme for compressible
flows with arbitrary specific heat ratio and Prandtl number is presented. In
the new scheme, which is based on a two-dimensional 16-discrete-velocity model,
the moment space and the corresponding transformation matrix are constructed
according t... |
1004.5479 | On Minimax Robust Detection of Stationary Gaussian Signals in White
Gaussian Noise | cs.IT math.IT math.ST stat.TH | The problem of detecting a wide-sense stationary Gaussian signal process
embedded in white Gaussian noise, where the power spectral density of the
signal process exhibits uncertainty, is investigated. The performance of
minimax robust detection is characterized by the exponential decay rate of the
miss probability un... |
1004.5500 | Simple Type Theory as Framework for Combining Logics | cs.LO cs.AI | Simple type theory is suited as framework for combining classical and
non-classical logics. This claim is based on the observation that various
prominent logics, including (quantified) multimodal logics and intuitionistic
logics, can be elegantly embedded in simple type theory. Furthermore, simple
type theory is suff... |
1004.5529 | High-Rate Vector Quantization for the Neyman-Pearson Detection of
Correlated Processes | cs.IT math.IT math.PR math.ST stat.TH | This paper investigates the effect of quantization on the performance of the
Neyman-Pearson test. It is assumed that a sensing unit observes samples of a
correlated stationary ergodic multivariate process. Each sample is passed
through an N-point quantizer and transmitted to a decision device which
performs a binary ... |
1004.5538 | Bayesian estimation of regularization and PSF parameters for Wiener-Hunt
deconvolution | stat.CO cs.CV physics.data-an stat.ME | This paper tackles the problem of image deconvolution with joint estimation
of PSF parameters and hyperparameters. Within a Bayesian framework, the
solution is inferred via a global a posteriori law for unknown parameters and
object. The estimate is chosen as the posterior mean, numerically calculated by
means of a M... |
1004.5540 | Strong Secrecy for Erasure Wiretap Channels | cs.IT math.IT | We show that duals of certain low-density parity-check (LDPC) codes, when
used in a standard coset coding scheme, provide strong secrecy over the binary
erasure wiretap channel (BEWC). This result hinges on a stopping set analysis
of ensembles of LDPC codes with block length $n$ and girth $\geq 2k$, for some
$k \geq ... |
1004.5551 | Entanglement Transmission over Arbitrarily Varying Quantum Channels | quant-ph cs.IT math.IT | We derive a regularized formula for the common randomness assisted
entanglement transmission capacity of finite arbitrarily varying quantum
channels (AVQC's). For finite AVQC's with positive capacity for classical
message transmission we show, by derandomization through classical forward
communication, that the rando... |
1004.5570 | Optimal computation of symmetric Boolean functions in Tree networks | cs.IT cs.NI math.IT | In this paper, we address the scenario where nodes with sensor data are
connected in a tree network, and every node wants to compute a given symmetric
Boolean function of the sensor data. We first consider the problem of computing
a function of two nodes with integer measurements. We allow for block
computation to en... |
1004.5571 | Optimal ordering of transmissions for computing Boolean threhold
functions | cs.IT cs.NI math.IT | We address a sequential decision problem that arises in the computation of
symmetric Boolean functions of distributed data. We consider a collocated
network, where each node's transmissions can be heard by every other node. Each
node has a Boolean measurement and we wish to compute a given Boolean function
of these m... |
1004.5588 | On Achieving Local View Capacity Via Maximal Independent Graph
Scheduling | cs.IT math.IT | "If we know more, we can achieve more." This adage also applies to
communication networks, where more information about the network state
translates into higher sumrates. In this paper, we formalize this increase of
sum-rate with increased knowledge of the network state. The knowledge of
network state is measured in ... |
1004.5601 | Near MDS poset codes and distributions | cs.IT math.IT | We study $q$-ary codes with distance defined by a partial order of the
coordinates of the codewords. Maximum Distance Separable (MDS) codes in the
poset metric have been studied in a number of earlier works. We consider codes
that are close to MDS codes by the value of their minimum distance. For such
codes, we deter... |
1005.0027 | Learning from Multiple Outlooks | cs.LG | We propose a novel problem formulation of learning a single task when the
data are provided in different feature spaces. Each such space is called an
outlook, and is assumed to contain both labeled and unlabeled data. The
objective is to take advantage of the data from all the outlooks to better
classify each of the ... |
1005.0047 | A Geometric View of Conjugate Priors | cs.LG | In Bayesian machine learning, conjugate priors are popular, mostly due to
mathematical convenience. In this paper, we show that there are deeper reasons
for choosing a conjugate prior. Specifically, we formulate the conjugate prior
in the form of Bregman divergence and show that it is the inherent geometry of
conjuga... |
1005.0052 | On the Joint Decoding of LDPC Codes and Finite-State Channels via Linear
Programming | cs.IT math.IT | In this paper, the linear programming (LP) decoder for binary linear codes,
introduced by Feldman, et al. is extended to joint-decoding of binary-input
finite-state channels. In particular, we provide a rigorous definition of LP
joint-decoding pseudo-codewords (JD-PCWs) that enables evaluation of the
pairwise error p... |
1005.0063 | Large Margin Multiclass Gaussian Classification with Differential
Privacy | stat.ML cs.CR cs.LG | As increasing amounts of sensitive personal information is aggregated into
data repositories, it has become important to develop mechanisms for processing
the data without revealing information about individual data instances. The
differential privacy model provides a framework for the development and
theoretical ana... |
1005.0069 | Perturbation Resilience and Superiorization of Iterative Algorithms | math.OC cs.CV physics.med-ph | Iterative algorithms aimed at solving some problems are discussed. For
certain problems, such as finding a common point in the intersection of a
finite number of convex sets, there often exist iterative algorithms that
impose very little demand on computer resources. For other problems, such as
finding that point in ... |
1005.0072 | HyberLoc: Providing Physical Layer Location Privacy in Hybrid Sensor
Networks | cs.IT cs.CR math.IT | In many hybrid wireless sensor networks' applications, sensor nodes are
deployed in hostile environments where trusted and un-trusted nodes co-exist.
In anchor-based hybrid networks, it becomes important to allow trusted nodes to
gain full access to the location information transmitted in beacon frames
while, at the ... |
1005.0075 | Distributive Stochastic Learning for Delay-Optimal OFDMA Power and
Subband Allocation | cs.LG | In this paper, we consider the distributive queue-aware power and subband
allocation design for a delay-optimal OFDMA uplink system with one base
station, $K$ users and $N_F$ independent subbands. Each mobile has an uplink
queue with heterogeneous packet arrivals and delay requirements. We model the
problem as an inf... |
1005.0080 | Electronic Geometry Textbook: A Geometric Textbook Knowledge Management
System | cs.AI cs.MS | Electronic Geometry Textbook is a knowledge management system that manages
geometric textbook knowledge to enable users to construct and share dynamic
geometry textbooks interactively and efficiently. Based on a knowledge base
organizing and storing the knowledge represented in specific languages, the
system implemen... |
1005.0089 | The Exact Closest String Problem as a Constraint Satisfaction Problem | cs.AI | We report (to our knowledge) the first evaluation of Constraint Satisfaction
as a computational framework for solving closest string problems. We show that
careful consideration of symbol occurrences can provide search heuristics that
provide several orders of magnitude speedup at and above the optimal distance.
We a... |
1005.0104 | Joint Structured Models for Extraction from Overlapping Sources | cs.AI | We consider the problem of jointly training structured models for extraction
from sources whose instances enjoy partial overlap. This has important
applications like user-driven ad-hoc information extraction on the web. Such
applications present new challenges in terms of the number of sources and their
arbitrary pat... |
1005.0117 | On the Separation of Lossy Source-Network Coding and Channel Coding in
Wireline Networks | cs.IT math.IT | This paper proves the separation between source-network coding and channel
coding in networks of noisy, discrete, memoryless channels. We show that the
set of achievable distortion matrices in delivering a family of dependent
sources across such a network equals the set of achievable distortion matrices
for deliverin... |
1005.0125 | Adaptive Bases for Reinforcement Learning | cs.LG cs.AI | We consider the problem of reinforcement learning using function
approximation, where the approximating basis can change dynamically while
interacting with the environment. A motivation for such an approach is
maximizing the value function fitness to the problem faced. Three errors are
considered: approximation squar... |
1005.0167 | A digital interface for Gaussian relay and interference networks:
Lifting codes from the discrete superposition model | cs.IT math.IT | For every Gaussian network, there exists a corresponding deterministic
network called the discrete superposition network. We show that this discrete
superposition network provides a near-optimal digital interface for operating a
class consisting of many Gaussian networks in the sense that any code for the
discrete su... |
1005.0188 | Generative and Latent Mean Map Kernels | cs.LG stat.ML | We introduce two kernels that extend the mean map, which embeds probability
measures in Hilbert spaces. The generative mean map kernel (GMMK) is a smooth
similarity measure between probabilistic models. The latent mean map kernel
(LMMK) generalizes the non-iid formulation of Hilbert space embeddings of
empirical dist... |
1005.0198 | Personnalisation de Syst\`emes OLAP Annot\'es | cs.DB | This paper deals with personalization of annotated OLAP systems. Data
constellation is extended to support annotations and user preferences.
Annotations reflect the decision-maker experience whereas user preferences
enable users to focus on the most interesting data. User preferences allow
annotated contextual recomm... |
1005.0201 | Personnalisation de bases de donn\'ees multidimensionnelles | cs.DB | This paper deals with decision support systems resting on multidimensional
modelling of data. Moreover, we intend to offer a set of concepts and
mechanisms for personalized multidimensional database specifications. This
personalization consists in associating weights to different components of a
multidimensional sche... |
1005.0202 | Dictionary Optimization for Block-Sparse Representations | cs.IT math.IT | Recent work has demonstrated that using a carefully designed dictionary
instead of a predefined one, can improve the sparsity in jointly representing a
class of signals. This has motivated the derivation of learning methods for
designing a dictionary which leads to the sparsest representation for a given
set of signa... |
1005.0212 | Construction graphique d'entrep\^ots et de magasins de donn\'ees | cs.DB | Nowadays, decisional systems have became a significant research topic in
databases. Data warehouses and data marts are the main elements of such
systems. This paper presents our decisional support system. We present
graphical interfaces which help the administrator to build data warehouses and
data marts. We present ... |
1005.0213 | Alg\`ebre OLAP et langage graphique | cs.DB | This article deals with OLAP systems based on multidimensional model. The
conceptual model we provide, represents data through a constellation
(multi-facts) composed of several multi-hierarchy dimensions. In this model,
data are displayed through multidimensional tables. We define a query algebra
handling these table... |
1005.0214 | Mod\'elisation et extraction de donn\'ees pour un entrep\^ot objet | cs.DB | This paper describes an object-oriented model for designing complex and
time-variant data warehouse data. The main contribution is the warehouse class
concept, which extends the class concept by temporal and archive filters as
well as a mapping function. Filters allow the keeping of relevant data changes
whereas the ... |
1005.0217 | Analyse multigraduelle OLAP | cs.DB | Decisional systems are based on multidimensional databases improving OLAP
analyses. The paper describes a new OLAP operator named "BLEND" to perform
multigradual analyses. The operation transforms multidimensional structures
during querying in order to analyse measures according to various granularity
levels, which a... |
1005.0218 | Contraintes pour mod\`ele et langage multidimensionnels | cs.DB | This paper defines a constraint-based model dedicated to multidimensional
databases. The model we define represents data through a constellation of facts
(subjects of analyse) associated to dimensions (axis of analyse), which are
possibly shared. Each dimension is organised according to several hierarchies
(views of ... |
1005.0219 | Mod\'elisation et manipulation de donn\'ees historis\'ees et archiv\'ees
dans un entrep\^ot orient\'e objet | cs.DB | This paper deals with temporal and archive object-oriented data warehouse
modelling and querying. In a first step, we define a data model describing
warehouses as central repositories of complex and temporal data extracted from
one information source. The model is based on the concepts of warehouse object
and environ... |
1005.0220 | Elaboration d'entrep\^ots de donn\'ees complexes | cs.DB | In this paper, we study the data warehouse modelling used in decision support
systems. We provide an object-oriented data warehouse model allowing data
warehouse description as a central repository of relevant, complex and temporal
data. Our model integrates three concepts such as warehouse object, environment
and wa... |
1005.0224 | Towards Conceptual Multidimensional Design in Decision Support Systems | cs.DB | Multidimensional databases support efficiently on-line analytical processing
(OLAP). In this paper, we depict a model dedicated to multidimensional
databases. The approach we present designs decisional information through a
constellation of facts and dimensions. Each dimension is possibly shared
between several facts... |
1005.0267 | Recovery of sparsest signals via $\ell^q$-minimization | cs.IT math.IT | In this paper, it is proved that every $s$-sparse vector ${\bf x}\in {\mathbb
R}^n$ can be exactly recovered from the measurement vector ${\bf z}={\bf A}
{\bf x}\in {\mathbb R}^m$ via some $\ell^q$-minimization with $0< q\le 1$, as
soon as each $s$-sparse vector ${\bf x}\in {\mathbb R}^n$ is uniquely
determined by th... |
1005.0268 | Node-Context Network Clustering using PARAFAC Tensor Decomposition | cs.IR | We describe a clustering method for labeled link network (semantic graph)
that can be used to group important nodes (highly connected nodes) with their
relevant link's labels by using PARAFAC tensor decomposition. In this kind of
network, the adjacency matrix can not be used to fully describe all information
about th... |
1005.0291 | The Compound Multiple Access Channel with Partially Cooperating Encoders | cs.IT math.IT | The goal of this paper is to provide a rigorous information-theoretic
analysis of subnetworks of interference networks. We prove two coding theorems
for the compound multiple-access channel with an arbitrary number of channel
states. The channel state information at the transmitters is such that each
transmitter has ... |
1005.0340 | Statistical Learning in Automated Troubleshooting: Application to LTE
Interference Mitigation | cs.LG | This paper presents a method for automated healing as part of off-line
automated troubleshooting. The method combines statistical learning with
constraint optimization. The automated healing aims at locally optimizing radio
resource management (RRM) or system parameters of cells with poor performance
in an iterative ... |
1005.0375 | Performance Analysis of Cognitive Radio Systems under QoS Constraints
and Channel Uncertainty | cs.IT math.IT | In this paper, performance of cognitive transmission over time-selective flat
fading channels is studied under quality of service (QoS) constraints and
channel uncertainty. Cognitive secondary users (SUs) are assumed to initially
perform channel sensing to detect the activities of the primary users, and then
attempt ... |
1005.0390 | Machine Learning for Galaxy Morphology Classification | astro-ph.GA cs.LG | In this work, decision tree learning algorithms and fuzzy inferencing systems
are applied for galaxy morphology classification. In particular, the CART, the
C4.5, the Random Forest and fuzzy logic algorithms are studied and reliable
classifiers are developed to distinguish between spiral galaxies, elliptical
galaxies... |
1005.0404 | Approximate Capacity of Gaussian Interference-Relay Networks with Weak
Cross Links | cs.IT math.IT | In this paper we study a Gaussian relay-interference network, in which relay
(helper) nodes are to facilitate competing information flows over a wireless
network. We focus on a two-stage relay-interference network where there are
weak cross-links, causing the networks to behave like a chain of Z Gaussian
channels. Fo... |
1005.0416 | Incremental Sampling-based Algorithms for Optimal Motion Planning | cs.RO | During the last decade, incremental sampling-based motion planning
algorithms, such as the Rapidly-exploring Random Trees (RRTs) have been shown
to work well in practice and to possess theoretical guarantees such as
probabilistic completeness. However, no theoretical bounds on the quality of
the solution obtained by ... |
1005.0419 | Capacity-Equivocation Region of the Gaussian MIMO Wiretap Channel | cs.IT cs.CR math.IT | We study the Gaussian multiple-input multiple-output (MIMO) wiretap channel,
which consists of a transmitter, a legitimate user, and an eavesdropper. In
this channel, the transmitter sends a common message to both the legitimate
user and the eavesdropper. In addition to this common message, the legitimate
user receiv... |
1005.0426 | Security in Distributed Storage Systems by Communicating a Logarithmic
Number of Bits | cs.CR cs.IT math.IT | We investigate the problem of maintaining an encoded distributed storage
system when some nodes contain adversarial errors. Using the error-correction
capabilities that are built into the existing redundancy of the system, we
propose a simple linear hashing scheme to detect errors in the storage nodes.
Our main resul... |
1005.0437 | A Unifying View of Multiple Kernel Learning | stat.ML cs.LG | Recent research on multiple kernel learning has lead to a number of
approaches for combining kernels in regularized risk minimization. The proposed
approaches include different formulations of objectives and varying
regularization strategies. In this paper we present a unifying general
optimization criterion for mult... |
1005.0498 | Classes of lower bounds on outage error probability and MSE in Bayesian
parameter estimation | cs.IT math.IT | In this paper, new classes of lower bounds on the outage error probability
and on the mean-square-error (MSE) in Bayesian parameter estimation are
proposed. The minima of the h-outage error probability and the MSE are obtained
by the generalized maximum a-posteriori probability and the minimum MSE (MMSE)
estimators, ... |
1005.0527 | Detecting the Most Unusual Part of Two and Three-dimensional Digital
Images | physics.data-an cs.CV physics.med-ph | The purpose of this paper is to introduce an algorithm that can detect the
most unusual part of a digital image in probabilistic setting. The most unusual
part of a given shape is defined as a part of the image that has the maximal
distance to all non intersecting shapes with the same form. The method is
tested on tw... |
1005.0530 | Feature Selection with Conjunctions of Decision Stumps and Learning from
Microarray Data | cs.LG cs.AI stat.ML | One of the objectives of designing feature selection learning algorithms is
to obtain classifiers that depend on a small number of attributes and have
verifiable future performance guarantees. There are few, if any, approaches
that successfully address the two goals simultaneously. Performance guarantees
become cruci... |
1005.0545 | Capacity of a Class of Broadcast Relay Channels | cs.IT math.IT | Consider the broadcast relay channel (BRC) which consists of a source sending
information over a two user broadcast
channel in presence of two relay nodes that help the transmission to the
destinations. Clearly, this network with
five nodes involves all the problems encountered in relay and broadcast
channels. Ne... |
1005.0605 | An approach to visualize the course of solving of a research task in
humans | cs.AI | A technique to study the dynamics of solving of a research task is suggested.
The research task was based on specially developed software Right- Wrong
Responder (RWR), with the participants having to reveal the response logic of
the program. The participants interacted with the program in the form of a
semi-binary di... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.