id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0912.4289 | Turbo Analog Error Correcting Codes Decodable By Linear Programming | cs.IT math.IT | In this paper we present a new Turbo analog error correcting coding scheme
for real valued signals that are corrupted by impulsive noise. This Turbo code
improves Donoho's deterministic construction by using a probabilistic approach.
More specifically, our construction corrects more errors than the matrices of
Donoho... |
0912.4473 | Learning to Predict Combinatorial Structures | cs.LG cs.AI | The major challenge in designing a discriminative learning algorithm for
predicting structured data is to address the computational issues arising from
the exponential size of the output space. Existing algorithms make different
assumptions to ensure efficient, polynomial time estimation of model
parameters. For seve... |
0912.4546 | Enhanced Feedback Iterative Decoding of Sparse Quantum Codes | quant-ph cs.IT math.IT | Decoding sparse quantum codes can be accomplished by syndrome-based decoding
using a belief propagation (BP) algorithm.We significantly improve this
decoding scheme by developing a new feedback adjustment strategy for the
standard BP algorithm. In our feedback procedure, we exploit much of the
information from stabil... |
0912.4553 | Consensus Dynamics in a non-deterministic Naming Game with Shared Memory | cs.MA cs.AI | In the naming game, individuals or agents exchange pairwise local information
in order to communicate about objects in their common environment. The goal of
the game is to reach a consensus about naming these objects. Originally used to
investigate language formation and self-organizing vocabularies, we extend the
cl... |
0912.4556 | On successive refinement of diversity for fading ISI channels | cs.IT math.IT | Rate and diversity impose a fundamental trade-off in communications. This
trade-off was investigated for flat-fading channels in [15] as well as for
Inter-symbol Interference (ISI) channels in [1]. A different point of view was
explored in [12] where high-rate codes were designed so that they have a
high-diversity co... |
0912.4571 | Fast Alternating Linearization Methods for Minimizing the Sum of Two
Convex Functions | math.OC cs.CV math.NA | We present in this paper first-order alternating linearization algorithms
based on an alternating direction augmented Lagrangian approach for minimizing
the sum of two convex functions. Our basic methods require at most
$O(1/\epsilon)$ iterations to obtain an $\epsilon$-optimal solution, while our
accelerated (i.e., ... |
0912.4584 | A Necessary and Sufficient Condition for Graph Matching Being Equivalent
to the Maximum Weight Clique Problem | cs.AI | This paper formulates a necessary and sufficient condition for a generic
graph matching problem to be equivalent to the maximum vertex and edge weight
clique problem in a derived association graph. The consequences of this results
are threefold: first, the condition is general enough to cover a broad range of
practic... |
0912.4595 | On the Optimal Number of Cooperative Base Stations in Network MIMO | cs.IT math.IT | We consider the multi-cell uplink (network MIMO) where M base-stations (BSs)
communicate simultaneously with M user terminals (UTs). Although the potential
benefit of multi-cell cooperation increases with M, the overhead related to
learning the uplink channels will rapidly dominate the uplink resource. In
other words... |
0912.4598 | Elkan's k-Means for Graphs | cs.AI | This paper extends k-means algorithms from the Euclidean domain to the domain
of graphs. To recompute the centroids, we apply subgradient methods for solving
the optimization-based formulation of the sample mean of graphs. To accelerate
the k-means algorithm for graphs without trading computational time against
solut... |
0912.4637 | Local and Global Trust Based on the Concept of Promises | cs.MA | We use the notion of a promise to define local trust between agents
possessing autonomous decision-making. An agent is trustworthy if it is
expected that it will keep a promise. This definition satisfies most
commonplace meanings of trust. Reputation is then an estimation of this
expectation value that is passed on f... |
0912.4649 | The use of ideas of Information Theory for studying "language" and
intelligence in ants | cs.IT cs.AI math.IT nlin.AO | In this review we integrate results of long term experimental study on ant
"language" and intelligence which were fully based on fundamental ideas of
Information Theory, such as the Shannon entropy, the Kolmogorov complexity, and
the Shannon's equation connecting the length of a message ($l$) and its
frequency $(p)$,... |
0912.4660 | Finding the Maximizers of the Information Divergence from an Exponential
Family | cs.IT math.IT | This paper investigates maximizers of the information divergence from an
exponential family $E$. It is shown that the $rI$-projection of a maximizer $P$
to $E$ is a convex combination of $P$ and a probability measure $P_-$ with
disjoint support and the same value of the sufficient statistics $A$. This
observation can... |
0912.4742 | Optimizing Histogram Queries under Differential Privacy | cs.DB cs.CR | Differential privacy is a robust privacy standard that has been successfully
applied to a range of data analysis tasks. Despite much recent work, optimal
strategies for answering a collection of correlated queries are not known.
We study the problem of devising a set of strategy queries, to be submitted
and answere... |
0912.4872 | Interpretations of Directed Information in Portfolio Theory, Data
Compression, and Hypothesis Testing | cs.IT math.IT | We investigate the role of Massey's directed information in portfolio theory,
data compression, and statistics with causality constraints. In particular, we
show that directed information is an upper bound on the increment in growth
rates of optimal portfolios in a stock market due to {causal} side information.
This ... |
0912.4879 | Similarit\'e en intension vs en extension : \`a la crois\'ee de
l'informatique et du th\'e\^atre | cs.AI | Traditional staging is based on a formal approach of similarity leaning on
dramaturgical ontologies and instanciation variations. Inspired by interactive
data mining, that suggests different approaches, we give an overview of
computer science and theater researches using computers as partners of the
actor to escape t... |
0912.4883 | On Finding Predictors for Arbitrary Families of Processes | cs.LG cs.AI cs.IT math.IT math.ST stat.TH | The problem is sequence prediction in the following setting. A sequence
$x_1,...,x_n,...$ of discrete-valued observations is generated according to
some unknown probabilistic law (measure) $\mu$. After observing each outcome,
it is required to give the conditional probabilities of the next observation.
The measure $\... |
0912.4884 | An Invariance Principle for Polytopes | cs.CC cs.CG cs.DM cs.LG math.PR | Let X be randomly chosen from {-1,1}^n, and let Y be randomly chosen from the
standard spherical Gaussian on R^n. For any (possibly unbounded) polytope P
formed by the intersection of k halfspaces, we prove that
|Pr [X belongs to P] - Pr [Y belongs to P]| < log^{8/5}k * Delta, where Delta
is a parameter that is sma... |
0912.4936 | Genus Computing for 3D digital objects: algorithm and implementation | cs.CV cs.CG | This paper deals with computing topological invariants such as connected
components, boundary surface genus, and homology groups. For each input data
set, we have designed or implemented algorithms to calculate connected
components, boundary surfaces and their genus, and homology groups. Due to the
fact that genus ca... |
0912.4988 | Sparse Recovery from Combined Fusion Frame Measurements | cs.IT math.IT | Sparse representations have emerged as a powerful tool in signal and
information processing, culminated by the success of new acquisition and
processing techniques such as Compressed Sensing (CS). Fusion frames are very
rich new signal representation methods that use collections of subspaces
instead of vectors to rep... |
0912.4991 | Complexity Analysis of Unsaturated Flow in Heterogeneous Media Using a
Complex Network Approach | cs.CE physics.geo-ph | In this study, we investigate the complexity of two-phase flow (air/water) in
a heterogeneous soil sample by using complex network theory, where the supposed
porous media is non-deformable media, under the time-dependent gas pressure.
Based on the different similarity measurements (i.e., correlation, Euclidean
metric... |
0912.4995 | 1-State Error-Trellis Decoding of LDPC Convolutional Codes Based on
Circulant Matrices | cs.IT math.IT | We consider the decoding of convolutional codes using an error trellis
constructed based on a submatrix of a given check matrix. In the proposed
method, the syndrome-subsequence computed using the remaining submatrix is
utilized as auxiliary information for decoding. Then the ML error path is
correctly decoded using ... |
0912.5009 | The MacWilliams Theorem for Four-Dimensional Modulo Metrics | cs.IT cs.DM math.IT | In this paper, the MacWilliams theorem is stated for codes over finite field
with four-dimensional modulo metrics.
|
0912.5029 | Complexity of stochastic branch and bound methods for belief tree search
in Bayesian reinforcement learning | cs.LG cs.AI | There has been a lot of recent work on Bayesian methods for reinforcement
learning exhibiting near-optimal online performance. The main obstacle facing
such methods is that in most problems of interest, the optimal solution
involves planning in an infinitely large tree. However, it is possible to
obtain stochastic lo... |
0912.5043 | Bit Error Rate is Convex at High SNR | cs.IT math.IT | Motivated by a wide-spread use of convex optimization techniques, convexity
properties of bit error rate of the maximum likelihood detector operating in
the AWGN channel are studied for arbitrary constellations and bit mappings,
which may also include coding under maximum-likelihood decoding. Under this
generic setti... |
0912.5055 | Rateless Codes for Single-Server Streaming to Diverse Users | cs.IT math.IT | We investigate the performance of rateless codes for single-server streaming
to diverse users, assuming that diversity in users is present not only because
they have different channel conditions, but also because they demand different
amounts of information and have different decoding capabilities. The LT
encoding sc... |
0912.5073 | A Rational Decision Maker with Ordinal Utility under Uncertainty:
Optimism and Pessimism | cs.AI cs.GT | In game theory and artificial intelligence, decision making models often
involve maximizing expected utility, which does not respect ordinal invariance.
In this paper, the author discusses the possibility of preserving ordinal
invariance and still making a rational decision under uncertainty.
|
0912.5079 | A Lower Bound on the Complexity of Approximating the Entropy of a Markov
Source | cs.IT math.IT | Suppose that, for any (k \geq 1), (\epsilon > 0) and sufficiently large
$\sigma$, we are given a black box that allows us to sample characters from a
$k$th-order Markov source over the alphabet (\{0, ..., \sigma - 1\}). Even if
we know the source has entropy either 0 or at least (\log (\sigma - k)), there
is still no... |
0912.5176 | On the deletion channel with small deletion probability | cs.IT math.IT | The deletion channel is the simplest point-to-point communication channel
that models lack of synchronization. Despite significant effort, little is
known about its capacity, and even less about optimal coding schemes. In this
paper we intiate a new systematic approach to this problem, by demonstrating
that capacity ... |
0912.5187 | Statistical Complexity in Traveling Densities | nlin.PS cs.IT math.IT quant-ph | In this work, we analyze the behavior of statistical complexity in several
systems where two identical densities that travel in opposite direction cross
each other. The crossing between two Gaussian, rectangular and triangular
densities is studied in detail. For these three cases, the shape of the total
density prese... |
0912.5193 | Ranking relations using analogies in biological and information networks | stat.ME cs.LG physics.soc-ph q-bio.QM stat.AP | Analogical reasoning depends fundamentally on the ability to learn and
generalize about relations between objects. We develop an approach to
relational learning which, given a set of pairs of objects
$\mathbf{S}=\{A^{(1)}:B^{(1)},A^{(2)}:B^{(2)},\ldots,A^{(N)}:B ^{(N)}\}$,
measures how well other pairs A:B fit in wit... |
0912.5235 | Using Multipartite Graphs for Recommendation and Discovery | astro-ph.IM cs.DL cs.IR physics.soc-ph | The Smithsonian/NASA Astrophysics Data System exists at the nexus of a dense
system of interacting and interlinked information networks. The syntactic and
the semantic content of this multipartite graph structure can be combined to
provide very specific research recommendations to the scientist/user.
|
0912.5241 | Believe It or Not: Adding Belief Annotations to Databases | cs.DB cs.AI | We propose a database model that allows users to annotate data with belief
statements. Our motivation comes from scientific database applications where a
community of users is working together to assemble, revise, and curate a shared
data repository. As the community accumulates knowledge and the database
content evo... |
0912.5287 | Uniqueness theorem for analytic functions and its application in
denoising problem | cs.IT math.IT | In various applications the problem of separation of the original signal and
the noise arises. For example, in the identification problem for discrete
linear and causal systems, the original signal consists of the values of
transfer function at some points in the unit disk. In this paper we discuss the
problem of cho... |
0912.5340 | Why so? or Why no? Functional Causality for Explaining Query Answers | cs.DB cs.AI | In this paper, we propose causality as a unified framework to explain query
answers and non-answers, thus generalizing and extending several previously
proposed approaches of provenance and missing query result explanations.
We develop our framework starting from the well-studied definition of actual
causes by Halp... |
0912.5353 | Diversity-Multiplexing-Delay Tradeoffs in MIMO Multihop Networks with
ARQ | cs.IT math.IT | Tradeoff in diversity, multiplexing, and delay in multihop MIMO relay
networks with ARQ is studied, where the random delay is caused by queueing and
ARQ retransmission. This leads to an optimal ARQ allocation problem with
per-hop delay or end-to-end delay constraint. The optimal ARQ allocation has to
trade off betwee... |
0912.5410 | A survey of statistical network models | stat.ME cs.LG physics.soc-ph q-bio.MN stat.ML | Networks are ubiquitous in science and have become a focal point for
discussion in everyday life. Formal statistical models for the analysis of
network data have emerged as a major topic of interest in diverse areas of
study, and most of these involve a form of graphical representation.
Probability models on graphs d... |
0912.5426 | The Hardness and Approximation Algorithms for L-Diversity | cs.DB | The existing solutions to privacy preserving publication can be classified
into the theoretical and heuristic categories. The former guarantees provably
low information loss, whereas the latter incurs gigantic loss in the worst
case, but is shown empirically to perform well on many real inputs. While
numerous heurist... |
0912.5434 | A Complete Theory of Everything (will be subjective) | cs.IT astro-ph.CO math.IT physics.pop-ph | Increasingly encompassing models have been suggested for our world. Theories
range from generally accepted to increasingly speculative to apparently bogus.
The progression of theories from ego- to geo- to helio-centric models to
universe and multiverse theories and beyond was accompanied by a dramatic
increase in the... |
0912.5449 | Time and Memory Efficient Lempel-Ziv Compression Using Suffix Arrays | cs.DS cs.IT math.IT | The well-known dictionary-based algorithms of the Lempel-Ziv (LZ) 77 family
are the basis of several universal lossless compression techniques. These
algorithms are asymmetric regarding encoding/decoding time and memory
requirements, with the former being much more demanding. In the past years,
considerable attention... |
0912.5456 | From a Link Semantic to Semantic Links - Building Context in Educational
Hypermedia | cs.IR cs.NI | Modularization and granulation are key concepts in educational content
management, whereas teaching, learning and understanding require a discourse
within thematic contexts. Even though hyperlinks and semantically typed
references provide the context building blocks of hypermedia systems, elaborate
concepts to derive... |
0912.5502 | Writer Identification Using Inexpensive Signal Processing Techniques | cs.CV | We propose to use novel and classical audio and text signal-processing and
otherwise techniques for "inexpensive" fast writer identification tasks of
scanned hand-written documents "visually". The "inexpensive" refers to the
efficiency of the identification process in terms of CPU cycles while
preserving decent accur... |
0912.5511 | A general approach to belief change in answer set programming | cs.AI | We address the problem of belief change in (nonmonotonic) logic programming
under answer set semantics. Unlike previous approaches to belief change in
logic programming, our formal techniques are analogous to those of
distance-based belief revision in propositional logic. In developing our
results, we build upon the ... |
0912.5533 | Oriented Straight Line Segment Algebra: Qualitative Spatial Reasoning
about Oriented Objects | cs.AI | Nearly 15 years ago, a set of qualitative spatial relations between oriented
straight line segments (dipoles) was suggested by Schlieder. This work received
substantial interest amongst the qualitative spatial reasoning community.
However, it turned out to be difficult to establish a sound constraint calculus
based o... |
0912.5537 | Quantum Reverse Shannon Theorem | quant-ph cs.IT math.IT | Dual to the usual noisy channel coding problem, where a noisy (classical or
quantum) channel is used to simulate a noiseless one, reverse Shannon theorems
concern the use of noiseless channels to simulate noisy ones, and more
generally the use of one noisy channel to simulate another. For channels of
nonzero capacity... |
1001.0001 | On the structure of non-full-rank perfect codes | cs.IT math.IT | The Krotov combining construction of perfect 1-error-correcting binary codes
from 2000 and a theorem of Heden saying that every non-full-rank perfect
1-error-correcting binary code can be constructed by this combining
construction is generalized to the $q$-ary case. Simply, every non-full-rank
perfect code $C$ is the... |
1001.0036 | The Computational Structure of Spike Trains | q-bio.NC cs.IT math.IT nlin.AO physics.data-an stat.ML | Neurons perform computations, and convey the results of those computations
through the statistical structure of their output spike trains. Here we present
a practical method, grounded in the information-theoretic analysis of
prediction, for inferring a minimal representation of that structure and for
characterizing i... |
1001.0054 | Cryptographic Implications for Artificially Mediated Games | cs.CR cs.AI cs.GT | There is currently an intersection in the research of game theory and
cryptography. Generally speaking, there are two aspects to this partnership.
First there is the application of game theory to cryptography. Yet, the purpose
of this paper is to focus on the second aspect, the converse of the first, the
application ... |
1001.0063 | On a Model for Integrated Information | cs.AI | In this paper we give a thorough presentation of a model proposed by Tononi
et al. for modeling \emph{integrated information}, i.e. how much information is
generated in a system transitioning from one state to the next one by the
causal interaction of its parts and \emph{above and beyond} the information
given by the... |
1001.0080 | Non-line-of-sight Node Localization based on Semi-Definite Programming
in Wireless Sensor Networks | cs.IT math.IT | An unknown-position sensor can be localized if there are three or more
anchors making time-of-arrival (TOA) measurements of a signal from it. However,
the location errors can be very large due to the fact that some of the
measurements are from non-line-of-sight (NLOS) paths. In this paper, we propose
a semi-definite ... |
1001.0107 | Exact Regeneration Codes for Distributed Storage Repair Using
Interference Alignment | cs.IT math.IT | The high repair cost of (n,k) Maximum Distance Separable (MDS) erasure codes
has recently motivated a new class of codes, called Regenerating Codes, that
optimally trade off storage cost for repair bandwidth. On one end of this
spectrum of Regenerating Codes are Minimum Storage Regenerating (MSR) codes
that can match... |
1001.0115 | Developing Artificial Herders Using Jason | cs.MA | This paper gives an overview of a proposed strategy for the "Cows and
Herders" scenario given in the Multi-Agent Programming Contest 2009. The
strategy is to be implemented using the Jason platform, based on the
agent-oriented programming language Agent-Speak. The paper describes the
agents, their goals and the strat... |
1001.0167 | Position Modulation Code for Rewriting Write-Once Memories | cs.IT math.IT | A write-once memory (wom) is a storage medium formed by a number of
``write-once'' bit positions (wits), where each wit initially is in a `0' state
and can be changed to a `1' state irreversibly. Examples of write-once memories
include SLC flash memories and optical disks. This paper presents a low
complexity coding ... |
1001.0210 | Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes | cs.IT cs.CR math.IT | Suppose Alice wishes to send messages to Bob through a communication channel
C_1, but her transmissions also reach an eavesdropper Eve through another
channel C_2. The goal is to design a coding scheme that makes it possible for
Alice to communicate both reliably and securely. Reliability is measured in
terms of Bob'... |
1001.0282 | Robust Image Watermarking in the Wavelet Domain for Copyright Protection | cs.IT cs.CR math.IT | In this paper a new approach to image watermarking in wavelet domain is
presented. The idea is to hide the watermark data in blocks of the block
segmented image. Two schemes are presented based on this idea by embedding the
watermark data in the low pass wavelet coefficients of each block. Due to low
computational co... |
1001.0339 | Tight oracle bounds for low-rank matrix recovery from a minimal number
of random measurements | cs.IT math.IT | This paper presents several novel theoretical results regarding the recovery
of a low-rank matrix from just a few measurements consisting of linear
combinations of the matrix entries. We show that properly constrained
nuclear-norm minimization stably recovers a low-rank matrix from a constant
number of noisy measurem... |
1001.0346 | Protocol design and stability/delay analysis of half-duplex buffered
cognitive relay systems | cs.IT math.IT | In this paper, we quantify the benefits of employing relay station in
large-coverage cognitive radio systems which opportunistically access the
licensed spectrum of some small-coverage primary systems scattered inside.
Through analytical study, we show that even a simple decode-and-forward (SDF)
relay, which can hold... |
1001.0357 | Orthogonal vs Non-Orthogonal Multiple Access with Finite Input Alphabet
and Finite Bandwidth | cs.IT math.IT | For a two-user Gaussian multiple access channel (GMAC), frequency division
multiple access (FDMA), a well known orthogonal-multiple-access (O-MA) scheme
has been preferred to non-orthogonal-multiple-access (NO-MA) schemes since FDMA
can achieve the sum-capacity of the channel with only single-user decoding
complexity... |
1001.0358 | Finiteness of rank invariants of multidimensional persistent homology
groups | math.AT cs.IT math.IT | Rank invariants are a parametrized version of Betti numbers of a space
multi-filtered by a continuous vector-valued function. In this note we give a
sufficient condition for their finiteness. This condition is sharp for spaces
embeddable in R^n.
|
1001.0405 | Optimal Query Complexity for Reconstructing Hypergraphs | cs.LG | In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let
$G$ be a weighted hidden hypergraph of constant rank with n vertices and $m$
hyperedges. For any $m$ there exists a non-adaptive algorithm that finds the
edges of t... |
1001.0440 | Tutoring System for Dance Learning | cs.IR cs.MM | Recent advances in hardware sophistication related to graphics display, audio
and video devices made available a large number of multimedia and hypermedia
applications. These multimedia applications need to store and retrieve the
different forms of media like text, hypertext, graphics, still images,
animations, audio... |
1001.0591 | Comparing Distributions and Shapes using the Kernel Distance | cs.CG cs.CV cs.LG | Starting with a similarity function between objects, it is possible to define
a distance metric on pairs of objects, and more generally on probability
distributions over them. These distance metrics have a deep basis in functional
analysis, measure theory and geometric measure theory, and have a rich
structure that i... |
1001.0597 | Inference of global clusters from locally distributed data | stat.ME cs.LG stat.ML | We consider the problem of analyzing the heterogeneity of clustering
distributions for multiple groups of observed data, each of which is indexed by
a covariate value, and inferring global clusters arising from observations
aggregated over the covariate domain. We propose a novel Bayesian nonparametric
method reposin... |
1001.0700 | Vandalism Detection in Wikipedia: a Bag-of-Words Classifier Approach | cs.LG cs.CY cs.IR | A bag-of-words based probabilistic classifier is trained using regularized
logistic regression to detect vandalism in the English Wikipedia. Isotonic
regression is used to calibrate the class membership probabilities. Learning
curve, reliability, ROC, and cost analysis are performed.
|
1001.0716 | Totally Asynchronous Interference Channels | cs.IT math.IT | This paper addresses an interference channel consisting of $\mathbf{n}$
active users sharing $u$ frequency sub-bands. Users are asynchronous meaning
there exists a mutual delay between their transmitted codes. A stationary model
for interference is considered by assuming the starting point of an
interferer's data is ... |
1001.0723 | MacWilliams Identities for Terminated Convolutional Codes | cs.IT math.IT | Shearer and McEliece [1977] showed that there is no MacWilliams identity for
the free distance spectra of orthogonal linear convolutional codes. We show
that on the other hand there does exist a MacWilliams identity between the
generating functions of the weight distributions per unit time of a linear
convolutional c... |
1001.0735 | Named Models in Coalgebraic Hybrid Logic | cs.LO cs.AI | Hybrid logic extends modal logic with support for reasoning about individual
states, designated by so-called nominals. We study hybrid logic in the broad
context of coalgebraic semantics, where Kripke frames are replaced with
coalgebras for a given functor, thus covering a wide range of reasoning
principles including... |
1001.0746 | Alternation-Trading Proofs, Linear Programming, and Lower Bounds | cs.CC cs.AI | A fertile area of recent research has demonstrated concrete polynomial time
lower bounds for solving natural hard problems on restricted computational
models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path,
Mod6-SAT, Majority-of-Majority-SAT, and Tautologies, to name a few. The proofs
of these l... |
1001.0793 | On the Vacationing CEO Problem: Achievable Rates and Outer Bounds | cs.IT math.IT | This paper studies a class of source coding problems that combines elements
of the CEO problem with the multiple description problem. In this setting,
noisy versions of one remote source are observed by two nodes with encoders
(which is similar to the CEO problem). However, it differs from the CEO problem
in that eac... |
1001.0820 | Abstract Answer Set Solvers with Learning | cs.AI cs.LO | Nieuwenhuis, Oliveras, and Tinelli (2006) showed how to describe enhancements
of the Davis-Putnam-Logemann-Loveland algorithm using transition systems,
instead of pseudocode. We design a similar framework for several algorithms
that generate answer sets for logic programs: Smodels, Smodels-cc, Asp-Sat with
Learning (... |
1001.0827 | Document Clustering with K-tree | cs.IR cs.AI cs.DS | This paper describes the approach taken to the XML Mining track at INEX 2008
by a group at the Queensland University of Technology. We introduce the K-tree
clustering algorithm in an Information Retrieval context by adapting it for
document clustering. Many large scale problems exist in document clustering.
K-tree sc... |
1001.0830 | K-tree: Large Scale Document Clustering | cs.IR cs.AI cs.DS | We introduce K-tree in an information retrieval context. It is an efficient
approximation of the k-means clustering algorithm. Unlike k-means it forms a
hierarchy of clusters. It has been extended to address issues with sparse
representations. We compare performance and quality to CLUTO using document
collections. Th... |
1001.0833 | Random Indexing K-tree | cs.IR cs.AI cs.DS | Random Indexing (RI) K-tree is the combination of two algorithms for
clustering. Many large scale problems exist in document clustering. RI K-tree
scales well with large inputs due to its low complexity. It also exhibits
features that are useful for managing a changing collection. Furthermore, it
solves previous issu... |
1001.0879 | Linear Probability Forecasting | cs.LG | Multi-class classification is one of the most important tasks in machine
learning. In this paper we consider two online multi-class classification
problems: classification by a linear model and by a kernelized model. The
quality of predictions is measured by the Brier loss function. We suggest two
computationally eff... |
1001.0887 | Stable Feature Selection for Biomarker Discovery | cs.CE q-bio.QM | Feature selection techniques have been used as the workhorse in biomarker
discovery applications for a long time. Surprisingly, the stability of feature
selection with respect to sampling variations has long been under-considered.
It is only until recently that this issue has received more and more attention.
In this... |
1001.0921 | Graph Quantization | cs.AI | Vector quantization(VQ) is a lossy data compression technique from signal
processing, which is restricted to feature vectors and therefore inapplicable
for combinatorial structures. This contribution presents a theoretical
foundation of graph quantization (GQ) that extends VQ to the domain of
attributed graphs. We pr... |
1001.0927 | Accelerating Competitive Learning Graph Quantization | cs.CV | Vector quantization(VQ) is a lossy data compression technique from signal
processing for which simple competitive learning is one standard method to
quantize patterns from the input space. Extending competitive learning VQ to
the domain of graphs results in competitive learning for quantizing input
graphs. In this co... |
1001.0958 | Effectively integrating information content and structural relationship
to improve the GO-based similarity measure between proteins | cs.CE q-bio.GN | The Gene Ontology (GO) provides a knowledge base to effectively describe
proteins. However, measuring similarity between proteins based on GO remains a
challenge. In this paper, we propose a new similarity measure, information
coefficient similarity measure (SimIC), to effectively integrate both the
information conte... |
1001.1009 | Multi-path Probabilistic Available Bandwidth Estimation through Bayesian
Active Learning | cs.NI cs.LG | Knowing the largest rate at which data can be sent on an end-to-end path such
that the egress rate is equal to the ingress rate with high probability can be
very practical when choosing transmission rates in video streaming or selecting
peers in peer-to-peer applications. We introduce probabilistic available
bandwidt... |
1001.1020 | An Empirical Evaluation of Four Algorithms for Multi-Class
Classification: Mart, ABC-Mart, Robust LogitBoost, and ABC-LogitBoost | cs.LG cs.AI cs.CV | This empirical study is mainly devoted to comparing four tree-based boosting
algorithms: mart, abc-mart, robust logitboost, and abc-logitboost, for
multi-class classification on a variety of publicly available datasets. Some of
those datasets have been thoroughly tested in prior studies using a broad range
of classif... |
1001.1021 | The Capacity of Random Linear Coding Networks as Subspace Channels | cs.IT math.IT | In this paper, we consider noncoherent random linear coding networks (RLCNs)
as a discrete memoryless channel (DMC) whose input and output alphabets consist
of subspaces. This contrasts with previous channel models in the literature
which assume matrices as the channel input and output. No particular
assumptions are ... |
1001.1026 | On Network-Error Correcting Convolutional Codes under the BSC Edge Error
Model | cs.IT math.IT | Convolutional network-error correcting codes (CNECCs) are known to provide
error correcting capability in acyclic instantaneous networks within the
network coding paradigm under small field size conditions. In this work, we
investigate the performance of CNECCs under the error model of the network
where the edges are... |
1001.1027 | An Unsupervised Algorithm For Learning Lie Group Transformations | cs.CV cs.LG | We present several theoretical contributions which allow Lie groups to be fit
to high dimensional datasets. Transformation operators are represented in their
eigen-basis, reducing the computational complexity of parameter estimation to
that of training a linear transformation model. A transformation specific
"blurrin... |
1001.1078 | Stability of multidimensional persistent homology with respect to domain
perturbations | math.AT cs.CG cs.IT math.IT | Motivated by the problem of dealing with incomplete or imprecise acquisition
of data in computer vision and computer graphics, we extend results concerning
the stability of persistent homology with respect to function perturbations to
results concerning the stability with respect to domain perturbations. Domain
pertu... |
1001.1079 | Measuring Latent Causal Structure | cs.LG | Discovering latent representations of the observed world has become
increasingly more relevant in data analysis. Much of the effort concentrates on
building latent variables which can be used in prediction problems, such as
classification and regression. A related goal of learning latent structure from
data is that o... |
1001.1106 | Optimal Thresholds for GMD Decoding with (L+1)/L-extended Bounded
Distance Decoders | cs.IT math.IT | We investigate threshold-based multi-trial decoding of concatenated codes
with an inner Maximum-Likelihood decoder and an outer error/erasure
(L+1)/L-extended Bounded Distance decoder, i.e. a decoder which corrects e
errors and t erasures if e(L+1)/L + t <= d - 1, where d is the minimum distance
of the outer code and... |
1001.1117 | Matrix Extension with Symmetry and Its Application to Filter Banks | cs.IT cs.NA math.IT math.NA math.RA | In this paper, we completely solve the matrix extension problem with symmetry
and provide a step-by-step algorithm to construct such a desired matrix
$\mathsf{P}_e$ from a given matrix $\mathsf{P}$. Furthermore, using a cascade
structure, we obtain a complete representation of any $r\times s$ paraunitary
matrix $\mat... |
1001.1122 | Principal manifolds and graphs in practice: from molecular biology to
dynamical systems | cs.NE cs.AI | We present several applications of non-linear data modeling, using principal
manifolds and principal graphs constructed using the metaphor of elasticity
(elastic principal graph approach). These approaches are generalizations of the
Kohonen's self-organizing maps, a class of artificial neural networks. On
several exa... |
1001.1133 | Multi-cell MIMO Downlink with Fairness Criteria: the Large System Limit | cs.IT math.IT | We consider the downlink of a cellular network with multiple cells and
multi-antenna base stations including arbitrary inter-cell cooperation,
realistic distance-dependent pathloss and general "fairness" requirements.
Beyond Monte Carlo simulation, no efficient computation method to evaluate the
ergodic throughput of... |
1001.1143 | Redundancy in Systems which Entertain a Model of Themselves: Interaction
Information and the Self-organization of Anticipation | cs.IR physics.soc-ph | Mutual information among three or more dimensions (mu-star = - Q) has been
considered as interaction information. However, Krippendorff (2009a, 2009b) has
shown that this measure cannot be interpreted as a unique property of the
interactions and has proposed an alternative measure of interaction information
based on ... |
1001.1187 | Joint Scheduling and ARQ for MU-MIMO Downlink in the Presence of
Inter-Cell Interference | cs.IT math.IT | User scheduling and multiuser multi-antenna (MU-MIMO) transmission are at the
core of high rate data-oriented downlink schemes of the next-generation of
cellular systems (e.g., LTE-Advanced). Scheduling selects groups of users
according to their channels vector directions and SINR levels. However, when
scheduling is ... |
1001.1197 | Construction of wiretap codes from ordinary channel codes | cs.IT cs.CR math.IT | From an arbitrary given channel code over a discrete or Gaussian memoryless
channel, we construct a wiretap code with the strong security. Our construction
can achieve the wiretap capacity under mild assumptions. The key tool is the
new privacy amplification theorem bounding the eavesdropped information in
terms of t... |
1001.1210 | Pure Parsimony Xor Haplotyping | cs.CE cs.DS | The haplotype resolution from xor-genotype data has been recently formulated
as a new model for genetic studies. The xor-genotype data is a cheaply
obtainable type of data distinguishing heterozygous from homozygous sites
without identifying the homozygous alleles. In this paper we propose a
formulation based on a we... |
1001.1214 | The Capacity of Finite-State Channels in the High-Noise Regime | cs.IT math.IT | This paper considers the derivative of the entropy rate of a hidden Markov
process with respect to the observation probabilities. The main result is a
compact formula for the derivative that can be evaluated easily using Monte
Carlo methods. It is applied to the problem of computing the capacity of a
finite-state cha... |
1001.1221 | Boosting k-NN for categorization of natural scenes | cs.CV | The k-nearest neighbors (k-NN) classification rule has proven extremely
successful in countless many computer vision applications. For example, image
categorization often relies on uniform voting among the nearest prototypes in
the space of descriptors. In spite of its good properties, the classic k-NN
rule suffers f... |
1001.1257 | Decisional Processes with Boolean Neural Network: the Emergence of
Mental Schemes | cs.AI | Human decisional processes result from the employment of selected quantities
of relevant information, generally synthesized from environmental incoming data
and stored memories. Their main goal is the production of an appropriate and
adaptive response to a cognitive or behavioral task. Different strategies of
respons... |
1001.1276 | A framework to model real-time databases | cs.DB | Real-time databases deal with time-constrained data and time-constrained
transactions. The design of this kind of databases requires the introduction of
new concepts to support both data structures and the dynamic behaviour of the
database. In this paper, we give an overview about different aspects of
real-time datab... |
1001.1278 | On Critical Relative Distance of DNA Codes for Additive Stem Similarity | cs.IT math.IT q-bio.BM q-bio.GN | We consider DNA codes based on the nearest-neighbor (stem) similarity model
which adequately reflects the "hybridization potential" of two DNA sequences.
Our aim is to present a survey of bounds on the rate of DNA codes with respect
to a thermodynamically motivated similarity measure called an additive stem
similarit... |
1001.1298 | Coded OFDM by Unique Word Prefix | cs.IT math.IT | In this paper we propose a novel transmit signal structure and an adjusted
and optimized receiver for OFDM (orthogonal frequency division multiplexing).
Instead of the conventional cyclic prefix we use a deterministic sequence,
which we call unique word (UW), as guard interval. We show how unique words,
which are alr... |
1001.1320 | Distributed scientific communication in the European information
society: Some cases of "Mode 2" fields of research | cs.IR cs.DL physics.soc-ph | Can self-organization of scientific communication be specified by using
literature-based indicators? In this study, we explore this question by
applying entropy measures to typical "Mode-2" fields of knowledge production.
We hypothesized these scientific systems to be developing from a
self-organization of the intera... |
1001.1373 | The Serializability of Network Codes | cs.IT cs.DS math.IT | Network coding theory studies the transmission of information in networks
whose vertices may perform nontrivial encoding and decoding operations on data
as it passes through the network. The main approach to deciding the feasibility
of network coding problems aims to reduce the problem to optimization over a
polytope... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.