id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0602093 | Rational stochastic languages | cs.LG cs.CL | The goal of the present paper is to provide a systematic and comprehensive
study of rational stochastic languages over a semiring K \in {Q, Q +, R, R+}. A
rational stochastic language is a probability distribution over a free monoid
\Sigma^* which is rational over K, that is which can be generated by a
multiplicity a... |
cs/0603003 | Analyse non standard du bruit | cs.CE math.LO math.OC math.PR quant-ph | Thanks to the nonstandard formalization of fast oscillating functions, due to
P. Cartier and Y. Perrin, an appropriate mathematical framework is derived for
new non-asymptotic estimation techniques, which do not necessitate any
statistical analysis of the noises corrupting any sensor. Various applications
are deduced... |
cs/0603004 | Lamarckian Evolution and the Baldwin Effect in Evolutionary Neural
Networks | cs.NE | Hybrid neuro-evolutionary algorithms may be inspired on Darwinian or
Lamarckian evolu- tion. In the case of Darwinian evolution, the Baldwin effect,
that is, the progressive incorporation of learned characteristics to the
genotypes, can be observed and leveraged to improve the search. The purpose of
this paper is to ... |
cs/0603007 | Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices
of Hamming Codes | cs.IT math.IT | Stopping sets, and in particular their numbers and sizes, play an important
role in determining the performance of iterative decoders of linear codes over
binary erasure channels. In the 2004 Shannon Lecture, McEliece presented an
expression for the number of stopping sets of size three for a full-rank
parity-check m... |
cs/0603008 | Linear Secret Sharing from Algebraic-Geometric Codes | cs.CR cs.IT math.IT | It is well-known that the linear secret-sharing scheme (LSSS) can be
constructed from linear error-correcting codes (Brickell [1], R.J. McEliece and
D.V.Sarwate [2],Cramer, el.,[3]). The theory of linear codes from
algebraic-geometric curves (algebraic-geometric (AG) codes or geometric Goppa
code) has been well-devel... |
cs/0603009 | An Achievability Result for the General Relay Channel | cs.IT math.IT | See cs.IT/0605135: R. Dabora, S. D. Servetto; On the Role of
Estimate-and-Forward with Time-Sharing in Cooperative Communications.
|
cs/0603010 | Asymptotic constant-factor approximation algorithm for the Traveling
Salesperson Problem for Dubins' vehicle | cs.RO | This article proposes the first known algorithm that achieves a
constant-factor approximation of the minimum length tour for a Dubins' vehicle
through $n$ points on the plane. By Dubins' vehicle, we mean a vehicle
constrained to move at constant speed along paths with bounded curvature
without reversing direction. Fo... |
cs/0603013 | On the MacWilliams Identity for Convolutional Codes | cs.IT math.IT math.OC | The adjacency matrix associated with a convolutional code collects in a
detailed manner information about the weight distribution of the code. A
MacWilliams Identity Conjecture, stating that the adjacency matrix of a code
fully determines the adjacency matrix of the dual code, will be formulated, and
an explicit form... |
cs/0603014 | Near orders and codes | cs.IT math.IT | Hoholdt, van Lint and Pellikaan used order functions to construct codes by
means of Linear Algebra and Semigroup Theory only. However, Geometric Goppa
codes that can be represented by this method are mainly those based on just one
point. In this paper we introduce the concept of near order function with the
aim of ge... |
cs/0603015 | The Basic Kak Neural Network with Complex Inputs | cs.NE | The Kak family of neural networks is able to learn patterns quickly, and this
speed of learning can be a decisive advantage over other competing models in
many applications. Amongst the implementations of these networks are those
using reconfigurable networks, FPGAs and optical networks. In some
applications, it is u... |
cs/0603018 | On Non-coherent MIMO Channels in the Wideband Regime: Capacity and
Reliability | cs.IT math.IT | We consider a multiple-input, multiple-output (MIMO) wideband Rayleigh block
fading channel where the channel state is unknown to both the transmitter and
the receiver and there is only an average power constraint on the input. We
compute the capacity and analyze its dependence on coherence length, number of
antennas... |
cs/0603020 | Reasoning About Knowledge of Unawareness | cs.LO cs.MA | Awareness has been shown to be a useful addition to standard epistemic logic
for many applications. However, standard propositional logics for knowledge and
awareness cannot express the fact that an agent knows that there are facts of
which he is unaware without there being an explicit fact that the agent knows
he is... |
cs/0603022 | On Separation, Randomness and Linearity for Network Codes over Finite
Fields | cs.IT math.IT | We examine the issue of separation and code design for networks that operate
over finite fields. We demonstrate that source-channel (or source-network)
separation holds for several canonical network examples like the noisy multiple
access channel and the erasure degraded broadcast channel, when the whole
network oper... |
cs/0603023 | Metric State Space Reinforcement Learning for a Vision-Capable Mobile
Robot | cs.RO cs.LG | We address the problem of autonomously learning controllers for
vision-capable mobile robots. We extend McCallum's (1995) Nearest-Sequence
Memory algorithm to allow for general metrics over state-action trajectories.
We demonstrate the feasibility of our approach by successfully running our
algorithm on a real mobile... |
cs/0603025 | Open Answer Set Programming with Guarded Programs | cs.AI | Open answer set programming (OASP) is an extension of answer set programming
where one may ground a program with an arbitrary superset of the program's
constants. We define a fixed point logic (FPL) extension of Clark's completion
such that open answer sets correspond to models of FPL formulas and identify a
syntacti... |
cs/0603026 | The Snowblower Problem | cs.DS cs.CC cs.RO | We introduce the snowblower problem (SBP), a new optimization problem that is
closely related to milling problems and to some material-handling problems. The
objective in the SBP is to compute a short tour for the snowblower to follow to
remove all the snow from a domain (driveway, sidewalk, etc.). When a snowblower
... |
cs/0603027 | On the Second-Order Statistics of the Instantaneous Mutual Information
in Rayleigh Fading Channels | cs.IT math.IT | In this paper, the second-order statistics of the instantaneous mutual
information are studied, in time-varying Rayleigh fading channels, assuming
general non-isotropic scattering environments. Specifically, first the
autocorrelation function, correlation coefficient, level crossing rate, and the
average outage durat... |
cs/0603028 | On the tree-transformation power of XSLT | cs.PL cs.DB | XSLT is a standard rule-based programming language for expressing
transformations of XML data. The language is currently in transition from
version 1.0 to 2.0. In order to understand the computational consequences of
this transition, we restrict XSLT to its pure tree-transformation capabilities.
Under this focus, we ... |
cs/0603031 | Performance Analysis of CDMA Signature Optimization with Finite Rate
Feedback | cs.IT cs.DM math.IT | We analyze the performance of CDMA signature optimization with finite rate
feedback. For a particular user, the receiver selects a signature vector from a
signature codebook to avoid the interference from other users, and feeds the
corresponding index back to this user through a finite rate and error-free
feedback li... |
cs/0603034 | Metatheory of actions: beyond consistency | cs.AI | Consistency check has been the only criterion for theory evaluation in
logic-based approaches to reasoning about actions. This work goes beyond that
and contributes to the metatheory of actions by investigating what other
properties a good domain description in reasoning about actions should have. We
state some metat... |
cs/0603038 | Estimation of linear, non-gaussian causal models in the presence of
confounding latent variables | cs.AI | The estimation of linear causal models (also known as structural equation
models) from data is a well-known problem which has received much attention in
the past. Most previous work has, however, made an explicit or implicit
assumption of gaussianity, limiting the identifiability of the models. We have
recently shown... |
cs/0603039 | Quantization Bounds on Grassmann Manifolds and Applications to MIMO
Communications | cs.IT math.IT | This paper considers the quantization problem on the Grassmann manifold
\mathcal{G}_{n,p}, the set of all p-dimensional planes (through the origin) in
the n-dimensional Euclidean space. The chief result is a closed-form formula
for the volume of a metric ball in the Grassmann manifold when the radius is
sufficiently ... |
cs/0603040 | On the Information Rate of MIMO Systems with Finite Rate Channel State
Feedback Using Beamforming and Power On/Off Strategy | cs.IT math.IT | It is well known that Multiple-Input Multiple-Output (MIMO) systems have high
spectral efficiency, especially when channel state information at the
transmitter (CSIT) is available. When CSIT is obtained by feedback, it is
practical to assume that the channel state feedback rate is finite and the CSIT
is not perfect. ... |
cs/0603041 | Locally Adaptive Block Thresholding Method with Continuity Constraint | cs.CV | We present an algorithm that enables one to perform locally adaptive block
thresholding, while maintaining image continuity. Images are divided into
sub-images based some standard image attributes and thresholding technique is
employed over the sub-images. The present algorithm makes use of the thresholds
of neighbor... |
cs/0603042 | The NoN Approach to Autonomic Face Recognition | cs.NE | A method of autonomic face recognition based on the biologically plausible
network of networks (NoN) model of information processing is presented. The NoN
model is based on locally parallel and globally coordinated transformations in
which the neurons or computational units form distributed networks, which
themselves... |
cs/0603044 | First Steps in Relational Lattice | cs.DB | Relational lattice reduces the set of six classic relational algebra
operators to two binary lattice operations: natural join and inner union. We
give an introduction to this theory with emphasis on formal algebraic laws. New
results include Spight distributivity criteria and its applications to query
transformations... |
cs/0603045 | Information and Errors in Quantum Teleportation | cs.IT math.IT | This article considers the question of the teleportation protocol from an
engineering perspective. The protocol ideally requires an authority that
ensures that the two communicating parties have a perfectly entangled pair of
particles available to them. But this cannot be unconditionally established to
the satisfacti... |
cs/0603049 | State Space Realizations and Monomial Equivalence for Convolutional
Codes | cs.IT math.IT math.OC | We will study convolutional codes with the help of state space realizations.
It will be shown that two such minimal realizations belong to the same code if
and only if they are equivalent under the full state feedback group. This
result will be used in order to prove that two codes with positive Forney
indices are mo... |
cs/0603053 | Automatic generation of simplified weakest preconditions for integrity
constraint verification | cs.DS cs.DB | Given a constraint $c$ assumed to hold on a database $B$ and an update $u$ to
be performed on $B$, we address the following question: will $c$ still hold
after $u$ is performed? When $B$ is a relational database, we define a
confluent terminating rewriting system which, starting from $c$ and $u$,
automatically derive... |
cs/0603056 | Does the arXiv lead to higher citations and reduced publisher downloads
for mathematics articles? | cs.DL cs.IR math.HO | An analysis of 2,765 articles published in four math journals from 1997 to
2005 indicate that articles deposited in the arXiv received 35% more citations
on average than non-deposited articles (an advantage of about 1.1 citations per
article), and that this difference was most pronounced for highly-cited
articles. Op... |
cs/0603058 | Convergence of Min-Sum Message Passing for Quadratic Optimization | cs.IT cs.AI math.IT | We establish the convergence of the min-sum message passing algorithm for
minimization of a broad class of quadratic objective functions: those that
admit a convex decomposition. Our results also apply to the equivalent problem
of the convergence of Gaussian belief propagation.
|
cs/0603059 | Derivatives of Entropy Rate in Special Families of Hidden Markov Chains | cs.IT math.IT math.PR | Consider a hidden Markov chain obtained as the observation process of an
ordinary Markov chain corrupted by noise. Zuk, et. al. [13], [14] showed how,
in principle, one can explicitly compute the derivatives of the entropy rate of
at extreme values of the noise. Namely, they showed that the derivatives of
standard up... |
cs/0603061 | Quasi-Orthogonal STBC With Minimum Decoding Complexity | cs.IT math.IT | In this paper, we consider a quasi-orthogonal (QO) space-time block code
(STBC) with minimum decoding complexity (MDC-QO-STBC). We formulate its
algebraic structure and propose a systematic method for its construction. We
show that a maximum-likelihood (ML) decoder for this MDC-QOSTBC, for any number
of transmit ante... |
cs/0603064 | Guessing under source uncertainty | cs.IT math.IT | This paper considers the problem of guessing the realization of a finite
alphabet source when some side information is provided. The only knowledge the
guesser has about the source and the correlated side information is that the
joint source is one among a family. A notion of redundancy is first defined and
a new div... |
cs/0603065 | MIMO Broadcast Channels with Finite Rate Feedback | cs.IT math.IT | Multiple transmit antennas in a downlink channel can provide tremendous
capacity (i.e. multiplexing) gains, even when receivers have only single
antennas. However, receiver and transmitter channel state information is
generally required. In this paper, a system where each receiver has perfect
channel knowledge, but t... |
cs/0603066 | A Feedback Reduction Technique for MIMO Broadcast Channels | cs.IT math.IT | A multiple antenna broadcast channel with perfect channel state information
at the receivers is considered. If each receiver quantizes its channel
knowledge to a finite number of bits which are fed back to the transmitter, the
large capacity benefits of the downlink channel can be realized. However, the
required numb... |
cs/0603068 | Universal Lossless Compression with Unknown Alphabets - The Average Case | cs.IT math.IT | Universal compression of patterns of sequences generated by independently
identically distributed (i.i.d.) sources with unknown, possibly large,
alphabets is investigated. A pattern is a sequence of indices that contains all
consecutive indices in increasing order of first occurrence. If the alphabet of
a source that... |
cs/0603070 | Predicting the Path of an Open System | cs.RO | The expected path of an open system,which is a big Poincare system,has been
found in this paper.This path has been obtained from the actual and from the
expected droop of the open system.The actual droop has been reconstructed from
the variations in the power and in the frequency of the open system.The
expected droop... |
cs/0603072 | Distributed Transmit Beamforming using Feedback Control | cs.IT math.IT | A simple feedback control algorithm is presented for distributed beamforming
in a wireless network. A network of wireless sensors that seek to cooperatively
transmit a common message signal to a Base Station (BS) is considered. In this
case, it is well-known that substantial energy efficiencies are possible by
using ... |
cs/0603073 | VXA: A Virtual Architecture for Durable Compressed Archives | cs.DL cs.IR | Data compression algorithms change frequently, and obsolete decoders do not
always run on new hardware and operating systems, threatening the long-term
usability of content archived using those algorithms. Re-encoding content into
new formats is cumbersome, and highly undesirable when lossy compression is
involved. P... |
cs/0603078 | Consensus Propagation | cs.IT cs.AI cs.NI math.IT | We propose consensus propagation, an asynchronous distributed protocol for
averaging numbers across a network. We establish convergence, characterize the
convergence rate for regular graphs, and demonstrate that the protocol exhibits
better scaling properties than pairwise averaging, an alternative that has
received ... |
cs/0603080 | Yet Another Efficient Unification Algorithm | cs.LO cs.AI | The unification algorithm is at the core of the logic programming paradigm,
the first unification algorithm being developed by Robinson [5]. More efficient
algorithms were developed later [3] and I introduce here yet another efficient
unification algorithm centered on a specific data structure, called the
Unification... |
cs/0603081 | Application of Support Vector Regression to Interpolation of Sparse
Shock Physics Data Sets | cs.AI | Shock physics experiments are often complicated and expensive. As a result,
researchers are unable to conduct as many experiments as they would like -
leading to sparse data sets. In this paper, Support Vector Machines for
regression are applied to velocimetry data sets for shock damaged and melted
tin metal. Some su... |
cs/0603083 | Entropy-optimal Generalized Token Bucket Regulator | cs.IT math.IT | We derive the maximum entropy of a flow (information utility) which conforms
to traffic constraints imposed by a generalized token bucket regulator, by
taking into account the covert information present in the randomness of packet
lengths. Under equality constraints of aggregate tokens and aggregate bucket
depth, a g... |
cs/0603086 | Matching Edges in Images ; Application to Face Recognition | cs.CV | This communication describes a representation of images as a set of edges
characterized by their position and orientation. This representation allows the
comparison of two images and the computation of their similarity. The first
step in this computation of similarity is the seach of a geometrical basis of
the two di... |
cs/0603090 | Topological Grammars for Data Approximation | cs.NE cs.LG | A method of {\it topological grammars} is proposed for multidimensional data
approximation. For data with complex topology we define a {\it principal cubic
complex} of low dimension and given complexity that gives the best
approximation for the dataset. This complex is a generalization of linear and
non-linear princi... |
cs/0603094 | On the Capacity Achieving Transmit Covariance Matrices of MIMO
Correlated Rician Channels: A Large System Approach | cs.IT math.IT | We determine the capacity-achieving input covariance matrices for coherent
block-fading correlated MIMO Rician channels. In contrast with the Rayleigh and
uncorrelated Rician cases, no closed-form expressions for the eigenvectors of
the optimum input covariance matrix are available. Both the eigenvectors and
eigenval... |
cs/0603095 | A Turbo Coding System for High Speed Communications | cs.IT math.IT | Conventional turbo codes (CTCs) usually employ a block-oriented interleaving
so that each block is separately encoded and decoded. As interleaving and
de-interleaving are performed within a block, the message-passing process
associated with an iterative decoder is limited to proceed within the
corresponding range. Th... |
cs/0603096 | On Reduced Complexity Soft-Output MIMO ML detection | cs.IT math.IT | In multiple-input multiple-output (MIMO) fading channels maximum likelihood
(ML) detection is desirable to achieve high performance, but its complexity
grows exponentially with the spectral efficiency. The current state of the art
in MIMO detection is list decoding and lattice decoding. This paper proposes a
new clas... |
cs/0603097 | On Pinsker's Type Inequalities and Csiszar's f-divergences. Part I:
Second and Fourth-Order Inequalities | cs.IT math.IT | We study conditions on $f$ under which an $f$-divergence $D_f$ will satisfy
$D_f \geq c_f V^2$ or $D_f \geq c_{2,f} V^2 + c_{4,f} V^4$, where $V$ denotes
variational distance and the coefficients $c_f$, $c_{2,f}$ and $c_{4,f}$ are
{\em best possible}. As a consequence, we obtain lower bounds in terms of $V$
for many ... |
cs/0603098 | A SIMO Fiber Aided Wireless Network Architecture | cs.IT math.IT | The concept of a fiber aided wireless network architecture (FAWNA) is
introduced in [Ray et al., Allerton Conference 2005], which allows high-speed
mobile connectivity by leveraging the speed of optical networks. In this paper,
we consider a single-input, multiple-output (SIMO) FAWNA, which consists of a
SIMO wireles... |
cs/0603103 | Bargaining over the interference channel | cs.IT math.IT | In this paper we analyze the interference channel as a conflict situation.
This viewpoint implies that certain points in the rate region are unreasonable
to one of the players. Therefore these points cannot be considered achievable
based on game theoretic considerations. We then propose to use Nash bargaining
solutio... |
cs/0603109 | Encoding of Functions of Correlated Sources | cs.IT math.IT | This submission is being withdrawn due to serious errors in the achievability
proofs. The reviewers of the journal I had submitted to had found errors back
in 2006. I had forgotten about this paper until I saw the CFP for a JSAC issue
on in-network computation.
http://www.jsac.ucsd.edu/Calls/in-networkcomputationcfp.... |
cs/0603110 | Asymptotic Learnability of Reinforcement Problems with Arbitrary
Dependence | cs.LG cs.AI | We address the problem of reinforcement learning in which observations may
exhibit an arbitrary form of stochastic dependence on past observations and
actions. The task for an agent is to attain the best possible asymptotic reward
where the true generating environment is unknown but belongs to a known
countable famil... |
cs/0603116 | Fourier Analysis and Holographic Representations of 1D and 2D Signals | cs.CV | In this paper, we focus on Fourier analysis and holographic transforms for
signal representation. For instance, in the case of image processing, the
holographic representation has the property that an arbitrary portion of the
transformed image enables reconstruction of the whole image with details
missing. We focus o... |
cs/0603120 | Approximation Algorithms for K-Modes Clustering | cs.AI | In this paper, we study clustering with respect to the k-modes objective
function, a natural formulation of clustering for categorical data. One of the
main contributions of this paper is to establish the connection between k-modes
and k-median, i.e., the optimum of k-median is at most twice the optimum of
k-modes fo... |
cs/0603123 | Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme | cs.IT math.IT | In a slow fading channel, how to find a cooperative diversity scheme that
achieves the transmit diversity bound is still an open problem. In fact, all
previously proposed amplify-and-forward (AF) and decode-and-forward (DF)
schemes do not improve with the number of relays in terms of the diversity
multiplexing tradeo... |
cs/0603124 | Diversity-Multiplexing Tradeoff of Double Scattering MIMO Channels | cs.IT math.IT | It is well known that the presence of double scattering degrades the
performance of a MIMO channel, in terms of both the multiplexing gain and the
diversity gain. In this paper, a closed-form expression of the
diversity-multiplexing tradeoff (DMT) of double scattering MIMO channels is
obtained. It is shown that, for ... |
cs/0603125 | If a tree casts a shadow is it telling the time? | cs.MA cs.GL | Physical processes are computations only when we use them to externalize
thought. Computation is the performance of one or more fixed processes within a
contingent environment. We reformulate the Church-Turing thesis so that it
applies to programs rather than to computability. When suitably formulated
agent-based com... |
cs/0603126 | Open at the Top; Open at the Bottom; and Continually (but Slowly)
Evolving | cs.MA | Systems of systems differ from traditional systems in that they are open at
the top, open at the bottom, and continually (but slowly) evolving. "Open at
the top" means that there is no pre-defined top level application. New
applications may be created at any time. "Open at the bottom" means that the
system primitives... |
cs/0603127 | Complex Systems + Systems Engineering = Complex Systems Engineeri | cs.MA | One may define a complex system as a system in which phenomena emerge as a
consequence of multiscale interaction among the system's components and their
environments. The field of Complex Systems is the study of such
systems--usually naturally occurring, either bio-logical or social. Systems
Engineering may be unders... |
cs/0603128 | On Cosets of the Generalized First-Order Reed-Muller Code with Low PMEPR | cs.IT math.IT | Golay sequences are well suited for the use as codewords in orthogonal
frequency-division multiplexing (OFDM), since their peak-to-mean envelope power
ratio (PMEPR) in q-ary phase-shift keying (PSK) modulation is at most 2. It is
known that a family of polyphase Golay sequences of length 2^m organizes in
m!/2 cosets ... |
cs/0603131 | Error Rate Analysis for Coded Multicarrier Systems over Quasi-Static
Fading Channels | cs.IT math.IT | This paper presents two methods for approximating the performance of coded
multicarrier systems operating over frequency-selective, quasi-static fading
channels with non-ideal interleaving. The first method is based on
approximating the performance of the system over each realization of the
channel, and is suitable f... |
cs/0604001 | Theoretical Properties of Projection Based Multilayer Perceptrons with
Functional Inputs | cs.NE | Many real world data are sampled functions. As shown by Functional Data
Analysis (FDA) methods, spectra, time series, images, gesture recognition data,
etc. can be processed more efficiently if their functional nature is taken into
account during the data analysis process. This is done by extending standard
data anal... |
cs/0604002 | Complexity of Consistent Query Answering in Databases under
Cardinality-Based and Incremental Repair Semantics | cs.DB cs.CC | Consistent Query Answering (CQA) is the problem of computing from a database
the answers to a query that are consistent with respect to certain integrity
constraints that the database, as a whole, may fail to satisfy. Consistent
answers have been characterized as those that are invariant under certain
minimal forms o... |
cs/0604004 | The Poincare conjecture for digital spaces. Properties of digital
n-dimensional disks and spheres | cs.DM cs.CV math.AT | Motivated by the Poincare conjecture, we study properties of digital
n-dimensional spheres and disks, which are digital models of their continuous
counterparts. We introduce homeomorphic transformations of digital manifolds,
which retain the connectedness, the dimension, the Euler characteristics and
the homology gro... |
cs/0604005 | Multiterminal Source Coding with Two Encoders--I: A Computable Outer
Bound | cs.IT math.IT | In this first part, a computable outer bound is proved for the multiterminal
source coding problem, for a setup with two encoders, discrete memoryless
sources, and bounded distortion measures.
|
cs/0604009 | Can an Organism Adapt Itself to Unforeseen Circumstances? | cs.AI | A model of an organism as an autonomous intelligent system has been proposed.
This model was used to analyze learning of an organism in various environmental
conditions. Processes of learning were divided into two types: strong and weak
processes taking place in the absence and the presence of aprioristic
information... |
cs/0604010 | Nearly optimal exploration-exploitation decision thresholds | cs.AI cs.LG | While in general trading off exploration and exploitation in reinforcement
learning is hard, under some formulations relatively simple solutions exist. In
this paper, we first derive upper bounds for the utility of selecting different
actions in the multi-armed bandit setting. Unlike the common statistical upper
conf... |
cs/0604011 | Semi-Supervised Learning -- A Statistical Physics Approach | cs.LG cond-mat.stat-mech cs.CV | We present a novel approach to semi-supervised learning which is based on
statistical physics. Most of the former work in the field of semi-supervised
learning classifies the points by minimizing a certain energy function, which
corresponds to a minimal k-way cut solution. In contrast to these methods, we
estimate th... |
cs/0604015 | Revealing the Autonomous System Taxonomy: The Machine Learning Approach | cs.NI cs.LG | Although the Internet AS-level topology has been extensively studied over the
past few years, little is known about the details of the AS taxonomy. An AS
"node" can represent a wide variety of organizations, e.g., large ISP, or small
private business, university, with vastly different network characteristics,
externa... |
cs/0604016 | On Conditional Branches in Optimal Search Trees | cs.PF cs.DS cs.IR | Algorithms for efficiently finding optimal alphabetic decision trees -- such
as the Hu-Tucker algorithm -- are well established and commonly used. However,
such algorithms generally assume that the cost per decision is uniform and thus
independent of the outcome of the decision. The few algorithms without this
assump... |
cs/0604021 | Low Latency Wireless Ad-Hoc Networking: Power and Bandwidth Challenges
and a Hierarchical Solution | cs.IT math.IT | This paper is concerned with the scaling of the number of hops in a large
scale wireless ad-hoc network (WANET), a quantity we call network latency. A
large network latency affects all aspects of data communication in a WANET,
including an increase in delay, packet loss, required processing power and
memory. We consi... |
cs/0604025 | An Extremal Inequality Motivated by Multiterminal Information Theoretic
Problems | cs.IT math.IT | We prove a new extremal inequality, motivated by the vector Gaussian
broadcast channel and the distributed source coding with a single quadratic
distortion constraint problems. As a corollary, this inequality yields a
generalization of the classical entropy-power inequality (EPI). As another
corollary, this inequalit... |
cs/0604027 | Unification of multi-lingual scientific terminological resources using
the ISO 16642 standard. The TermSciences initiative | cs.CL | This paper presents the TermSciences portal, which deals with the
implementation of a conceptual model that uses the recent ISO 16642 standard
(Terminological Markup Framework). This standard turns out to be suitable for
concept modeling since it allowed for organizing the original resources by
concepts and to associ... |
cs/0604028 | Two Proofs of the Fisher Information Inequality via Data Processing
Arguments | cs.IT math.IT | Two new proofs of the Fisher information inequality (FII) using data
processing inequalities for mutual information and conditional variance are
presented.
|
cs/0604029 | Order-Optimal Data Aggregation in Wireless Sensor Networks - Part I:
Regular Networks | cs.IT math.IT | The predominate traffic patterns in a wireless sensor network are many-to-one
and one-to-many communication. Hence, the performance of wireless sensor
networks is characterized by the rate at which data can be disseminated from or
aggregated to a data sink. In this paper, we consider the data aggregation
problem. We ... |
cs/0604030 | The Influence of Adaptive Multicoding on Mutual Information and Channel
Capacity for Uncertain Wideband CDMA Rayleigh Fading Channels | cs.IT math.IT | We consider the problem of adaptive modulation for wideband DS-CDMA Rayleigh
fading channels with imperfect channel state information (CSI). We assume a
multidimensional signal subspace spanned by a collection of random spreading
codes (multicoding) and study the effects of both the subspace dimension and
the probabi... |
cs/0604031 | On the Low SNR Capacity of Peak-Limited Non-Coherent Fading Channels
with Memory | cs.IT math.IT | The capacity of non-coherent stationary Gaussian fading channels with memory
under a peak-power constraint is studied in the asymptotic weak-signal regime.
It is assumed that the fading law is known to both transmitter and receiver but
that neither is cognizant of the fading realization. A connection is
demonstrated ... |
cs/0604033 | Statistical Properties of Eigen-Modes and Instantaneous Mutual
Information in MIMO Time-Varying Rayleigh Channels | cs.IT math.IT | In this paper, we study two important metrics in multiple-input
multiple-output (MIMO) time-varying Rayleigh flat fading channels. One is the
eigen-mode, and the other is the instantaneous mutual information (IMI). Their
second-order statistics, such as the correlation coefficient, level crossing
rate (LCR), and aver... |
cs/0604036 | Collaborative thesaurus tagging the Wikipedia way | cs.IR cs.DL | This paper explores the system of categories that is used to classify
articles in Wikipedia. It is compared to collaborative tagging systems like
del.icio.us and to hierarchical classification like the Dewey Decimal
Classification (DDC). Specifics and commonalitiess of these systems of subject
indexing are exposed. A... |
cs/0604038 | UniCalc.LIN: a linear constraint solver for the UniCalc system | cs.MS cs.AI | In this short paper we present a linear constraint solver for the UniCalc
system, an environment for reliable solution of mathematical modeling problems.
|
cs/0604040 | Optimal Distortion-Power Tradeoffs in Sensor Networks: Gauss-Markov
Random Processes | cs.IT math.IT | We investigate the optimal performance of dense sensor networks by studying
the joint source-channel coding problem. The overall goal of the sensor network
is to take measurements from an underlying random process, code and transmit
those measurement samples to a collector node in a cooperative multiple access
channe... |
cs/0604042 | Adaptative combination rule and proportional conflict redistribution
rule for information fusion | cs.AI | This paper presents two new promising rules of combination for the fusion of
uncertain and potentially highly conflicting sources of evidences in the
framework of the theory of belief functions in order to palliate the well-know
limitations of Dempster's rule and to work beyond the limits of applicability
of the Demp... |
cs/0604046 | Concerning the differentiability of the energy function in vector
quantization algorithms | cs.LG cs.NE | The adaptation rule for Vector Quantization algorithms, and consequently the
convergence of the generated sequence, depends on the existence and properties
of a function called the energy function, defined on a topological manifold.
Our aim is to investigate the conditions of existence of such a function for a
class ... |
cs/0604049 | Low SNR Capacity of Fading Channels with Peak and Average Power
Constraints | cs.IT math.IT | Flat-fading channels that are correlated in time are considered under peak
and average power constraints. For discrete-time channels, a new upper bound on
the capacity per unit time is derived. A low SNR analysis of a full-scattering
vector channel is used to derive a complimentary lower bound. Together, these
bounds... |
cs/0604054 | New results on rewrite-based satisfiability procedures | cs.AI cs.LO | Program analysis and verification require decision procedures to reason on
theories of data structures. Many problems can be reduced to the satisfiability
of sets of ground literals in theory T. If a sound and complete inference
system for first-order logic is guaranteed to terminate on T-satisfiability
problems, any... |
cs/0604056 | A Short Note on The Volume of Hypersphere | cs.IT math.IT | In this note, a new method for deriving the volume of hypersphere is proposed
by using probability theory. The explicit expression of the multiple times
convolution of the probability density functions we should use is very
complicated. But in here, we don't need its whole explicit expression. We just
need the only a... |
cs/0604057 | A New Fault-Tolerant M-network and its Analysis | cs.IT math.IT | This paper introduces a new class of efficient inter connection networks
called as M-graphs for large multi-processor systems.The concept of M-matrix
and M-graph is an extension of Mn-matrices and Mn-graphs.We analyze these
M-graphs regarding their suitability for large multi-processor systems. An(p,N)
M-graph consis... |
cs/0604062 | Biologically Inspired Hierarchical Model for Feature Extraction and
Localization | cs.CV | Feature extraction and matching are among central problems of computer
vision. It is inefficent to search features over all locations and scales.
Neurophysiological evidence shows that to locate objects in a digital image the
human visual system employs visual attention to a specific object while
ignoring others. The... |
cs/0604063 | Golden Space-Time Trellis Coded Modulation | cs.IT math.IT | In this paper, we present a concatenated coding scheme for a high rate
$2\times 2$ multiple-input multiple-output (MIMO) system over slow fading
channels. The inner code is the Golden code \cite{Golden05} and the outer code
is a trellis code. Set partitioning of the Golden code is designed specifically
to increase th... |
cs/0604064 | Quantum Fuzzy Sets: Blending Fuzzy Set Theory and Quantum Computation | cs.LO cs.AI | In this article we investigate a way in which quantum computing can be used
to extend the class of fuzzy sets. The core idea is to see states of a quantum
register as characteristic functions of quantum fuzzy subsets of a given set.
As the real unit interval is embedded in the Bloch sphere, every fuzzy set is
automat... |
cs/0604069 | Universal decoding with an erasure option | cs.IT math.IT | Motivated by applications of rateless coding, decision feedback, and ARQ, we
study the problem of universal decoding for unknown channels, in the presence
of an erasure option. Specifically, we harness the competitive minimax
methodology developed in earlier studies, in order to derive a universal
version of Forney's... |
cs/0604070 | Retraction and Generalized Extension of Computing with Words | cs.AI | Fuzzy automata, whose input alphabet is a set of numbers or symbols, are a
formal model of computing with values. Motivated by Zadeh's paradigm of
computing with words rather than numbers, Ying proposed a kind of fuzzy
automata, whose input alphabet consists of all fuzzy subsets of a set of
symbols, as a formal model... |
cs/0604071 | Distributed Metadata with the AMGA Metadata Catalog | cs.DC cs.DB | Catalog Services play a vital role on Data Grids by allowing users and
applications to discover and locate the data needed. On large Data Grids, with
hundreds of geographically distributed sites, centralized Catalog Services do
not provide the required scalability, performance or fault-tolerance. In this
article, we ... |
cs/0604074 | Information and multiaccess interference in a complexity-constrained
vector channel | cs.IT math.IT | Rodrigo de Miguel et al 2007 J. Phys. A: Math. Theor. 40 5241-5260: A noisy
vector channel operating under a strict complexity constraint at the receiver
is introduced. According to this constraint, detected bits, obtained by
performing hard decisions directly on the channel's matched filter output, must
be the same ... |
cs/0604075 | Naming Games in Spatially-Embedded Random Networks | cs.MA cond-mat.stat-mech cs.AI | We investigate a prototypical agent-based model, the Naming Game, on random
geometric networks. The Naming Game is a minimal model, employing local
communications that captures the emergence of shared communication schemes
(languages) in a population of autonomous semiotic agents. Implementing the
Naming Games on ran... |
cs/0604076 | Semantically Correct Query Answers in the Presence of Null Values | cs.DB | For several reasons a database may not satisfy a given set of integrity
constraints(ICs), but most likely most of the information in it is still
consistent with those ICs; and could be retrieved when queries are answered.
Consistent answers to queries wrt a set of ICs have been characterized as
answers that can be ob... |
cs/0604077 | Successive Wyner-Ziv Coding Scheme and its Application to the Quadratic
Gaussian CEO Problem | cs.IT math.IT | We introduce a distributed source coding scheme called successive Wyner-Ziv
coding. We show that any point in the rate region of the quadratic Gaussian CEO
problem can be achieved via the successive Wyner-Ziv coding. The concept of
successive refinement in the single source coding is generalized to the
distributed so... |
cs/0604078 | The emergence of knowledge exchange: an agent-based model of a software
market | cs.MA cs.CE | We investigate knowledge exchange among commercial organisations, the
rationale behind it and its effects on the market. Knowledge exchange is known
to be beneficial for industry, but in order to explain it, authors have used
high level concepts like network effects, reputation and trust. We attempt to
formalise a pl... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.