id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0810.2434 | Faster and better: a machine learning approach to corner detection | cs.CV cs.LG | The repeatability and efficiency of a corner detector determines how likely
it is to be useful in a real-world application. The repeatability is importand
because the same scene viewed from different positions should yield features
which correspond to the same real-world 3D locations [Schmid et al 2000]. The
efficien... |
0810.2513 | The Impact of Mobility on Gossip Algorithms | cs.NI cs.DC cs.IT math.IT | The influence of node mobility on the convergence time of averaging gossip
algorithms in networks is studied. It is shown that a small number of fully
mobile nodes can yield a significant decrease in convergence time. A method is
developed for deriving lower bounds on the convergence time by merging nodes
according t... |
0810.2529 | On the Throughput Maximization in Dencentralized Wireless Networks | cs.IT math.IT | A distributed single-hop wireless network with $K$ links is considered, where
the links are partitioned into a fixed number ($M$) of clusters each operating
in a subchannel with bandwidth $\frac{W}{M}$. The subchannels are assumed to be
orthogonal to each other. A general shadow-fading model, described by
parameters ... |
0810.2598 | New avenue to the Parton Distribution Functions: Self-Organizing Maps | hep-ph cs.CE | Neural network algorithms have been recently applied to construct Parton
Distribution Function (PDF) parametrizations which provide an alternative to
standard global fitting procedures. We propose a technique based on an
interactive neural network algorithm using Self-Organizing Maps (SOMs). SOMs
are a class of clust... |
0810.2653 | On combinations of local theory extensions | cs.LO cs.AI | In this paper we study possibilities of efficient reasoning in combinations
of theories over possibly non-disjoint signatures. We first present a class of
theory extensions (called local extensions) in which hierarchical reasoning is
possible, and give several examples from computer science and mathematics in
which s... |
0810.2665 | Path Planner for Objects, Robots and Mannequins by Multi-Agents Systems
or Motion Captures | cs.RO | In order to optimise the costs and time of design of the new products while
improving their quality, concurrent engineering is based on the digital model
of these products. However, in order to be able to avoid definitively physical
model without loss of information, new tools must be available. Especially, a
tool ma... |
0810.2666 | A Vision-based Computed Torque Control for Parallel Kinematic Machines | cs.RO | In this paper, a novel approach for parallel kinematic machine control
relying on a fast exteroceptive measure is implemented and validated on the
Orthoglide robot. This approach begins with rewriting the robot models as a
function of the only end-effector pose. It is shown that such an operation
reduces the model co... |
0810.2746 | Finite-SNR Diversity-Multiplexing Tradeoff and Optimum Power Allocation
in Bidirectional Cooperative Networks | cs.IT math.IT | This paper focuses on analog network coding (ANC) and time division
broadcasting (TDBC) which are two major protocols used in bidirectional
cooperative networks. Lower bounds of the outage probabilities of those two
protocols are derived first. Those lower bounds are extremely tight in the
whole signal-to-noise ratio... |
0810.2764 | A Simple Linear Ranking Algorithm Using Query Dependent Intercept
Variables | cs.IR cs.LG | The LETOR website contains three information retrieval datasets used as a
benchmark for testing machine learning ideas for ranking. Algorithms
participating in the challenge are required to assign score values to search
results for a collection of queries, and are measured using standard IR ranking
measures (NDCG, pr... |
0810.2781 | Linear Time Encoding of LDPC Codes | cs.IT math.IT | In this paper, we propose a linear complexity encoding method for arbitrary
LDPC codes. We start from a simple graph-based encoding method
``label-and-decide.'' We prove that the ``label-and-decide'' method is
applicable to Tanner graphs with a hierarchical structure--pseudo-trees-- and
that the resulting encoding co... |
0810.2861 | A comparison of the notions of optimality in soft constraints and
graphical games | cs.AI cs.GT | The notion of optimality naturally arises in many areas of applied
mathematics and computer science concerned with decision making. Here we
consider this notion in the context of two formalisms used for different
purposes and in different research areas: graphical games and soft constraints.
We relate the notion of o... |
0810.2924 | BER and Outage Probability Approximations for LMMSE Detectors on
Correlated MIMO Channels | cs.IT math.IT | This paper is devoted to the study of the performance of the Linear Minimum
Mean-Square Error receiver for (receive) correlated Multiple-Input
Multiple-Output systems. By the random matrix theory, it is well-known that the
Signal-to-Noise Ratio (SNR) at the output of this receiver behaves
asymptotically like a Gaussi... |
0810.2953 | On Power Control and Frequency Reuse in the Two User Cognitive Channel | cs.IT math.IT | This paper considers the generalized cognitive radio channel where the
secondary user is allowed to reuse the frequency during both the idle and
active periods of the primary user, as long as the primary rate remains the
same. In this setting, the optimal power allocation policy with single-input
single-output (SISO)... |
0810.3076 | Combining Semantic Wikis and Controlled Natural Language | cs.HC cs.AI | We demonstrate AceWiki that is a semantic wiki using the controlled natural
language Attempto Controlled English (ACE). The goal is to enable easy creation
and modification of ontologies through the web. Texts in ACE can automatically
be translated into first-order logic and other languages, for example OWL.
Previous... |
0810.3125 | On the Vocabulary of Grammar-Based Codes and the Logical Consistency of
Texts | cs.IT cs.CL math.IT | The article presents a new interpretation for Zipf-Mandelbrot's law in
natural language which rests on two areas of information theory. Firstly, we
construct a new class of grammar-based codes and, secondly, we investigate
properties of strongly nonergodic stationary processes. The motivation for the
joint discussion... |
0810.3136 | On the Complexity of Core, Kernel, and Bargaining Set | cs.GT cs.AI cs.CC | Coalitional games are mathematical models suited to analyze scenarios where
players can collaborate by forming coalitions in order to obtain higher worths
than by acting in isolation. A fundamental problem for coalitional games is to
single out the most desirable outcomes in terms of appropriate notions of worth
dist... |
0810.3226 | Optimal Transmission Strategy and Explicit Capacity Region for Broadcast
Z Channels | cs.IT math.IT | This paper provides an explicit expression for the capacity region of the
two-user broadcast Z channel and proves that the optimal boundary can be
achieved by independent encoding of each user. Specifically, the information
messages corresponding to each user are encoded independently and the OR of
these two encoded ... |
0810.3227 | Dynamic Approaches to In-Network Aggregation | cs.DC cs.DB cs.DS | Collaboration between small-scale wireless devices hinges on their ability to
infer properties shared across multiple nearby nodes. Wireless-enabled mobile
devices in particular create a highly dynamic environment not conducive to
distributed reasoning about such global properties. This paper addresses a
specific ins... |
0810.3283 | Quantum robot: structure, algorithms and applications | cs.RO cs.AI quant-ph | This paper has been withdrawn.
|
0810.3294 | A static theory of promises | cs.MA cs.SE | We discuss for the concept of promises within a framework that can be applied
to either humans or technology. We compare promises to the more established
notion of obligations and find promises to be both simpler and more effective
at reducing uncertainty in behavioural outcomes.
|
0810.3356 | The Fundamental Problem with the Building Block Hypothesis | cs.NE | Skepticism of the building block hypothesis (BBH) has previously been
expressed on account of the weak theoretical foundations of this hypothesis and
the anomalies in the empirical record of the simple genetic algorithm. In this
paper we hone in on a more fundamental cause for skepticism--the extraordinary
strength o... |
0810.3357 | Two Remarkable Computational Competencies of the Simple Genetic
Algorithm | cs.NE | Since the inception of genetic algorithmics the identification of
computational efficiencies of the simple genetic algorithm (SGA) has been an
important goal. In this paper we distinguish between a computational competency
of the SGA--an efficient, but narrow computational ability--and a computational
proficiency of ... |
0810.3416 | Text as Statistical Mechanics Object | cs.CL physics.soc-ph | In this article we present a model of human written text based on statistical
mechanics approach by deriving the potential energy for different parts of the
text using large text corpus. We have checked the results numerically and found
that the specific heat parameter effectively separates the closed class words
fro... |
0810.3418 | Detecting the Most Unusual Part of a Digital Image | cs.CV cs.GR | The purpose of this paper is to introduce an algorithm that can detect the
most unusual part of a digital image. 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 can be used to scan image databases wi... |
0810.3422 | Coding Theorems for Repeat Multiple Accumulate Codes | cs.IT math.IT | In this paper the ensemble of codes formed by a serial concatenation of a
repetition code with multiple accumulators connected through random
interleavers is considered. Based on finite length weight enumerators for these
codes, asymptotic expressions for the minimum distance and an arbitrary number
of accumulators l... |
0810.3442 | Language structure in the n-object naming game | cs.CL cs.MA physics.soc-ph | We examine a naming game with two agents trying to establish a common
vocabulary for n objects. Such efforts lead to the emergence of language that
allows for an efficient communication and exhibits some degree of homonymy and
synonymy. Although homonymy reduces the communication efficiency, it seems to
be a dynamica... |
0810.3451 | The many faces of optimism - Extended version | cs.AI cs.CC cs.LG | The exploration-exploitation dilemma has been an intriguing and unsolved
problem within the framework of reinforcement learning. "Optimism in the face
of uncertainty" and model building play central roles in advanced exploration
methods. Here, we integrate several concepts and obtain a fast and simple
algorithm. We s... |
0810.3474 | Social Learning Methods in Board Games | cs.AI cs.MA | This paper discusses the effects of social learning in training of game
playing agents. The training of agents in a social context instead of a
self-play environment is investigated. Agents that use the reinforcement
learning algorithms are trained in social settings. This mimics the way in
which players of board gam... |
0810.3484 | A Study of NK Landscapes' Basins and Local Optima Networks | cs.NE | We propose a network characterization of combinatorial fitness landscapes by
adapting the notion of inherent networks proposed for energy surfaces (Doye,
2002). We use the well-known family of $NK$ landscapes as an example. In our
case the inherent network is the graph where the vertices are all the local
maxima and ... |
0810.3492 | The Connectivity of NK Landscapes' Basins: A Network Analysis | cs.NE | We propose a network characterization of combinatorial fitness landscapes by
adapting the notion of inherent networks proposed for energy surfaces. We use
the well-known family of NK landscapes as an example. In our case the inherent
network is the graph where the vertices represent the local maxima in the
landscape,... |
0810.3525 | The use of entropy to measure structural diversity | cs.LG cs.AI q-bio.QM | In this paper entropy based methods are compared and used to measure
structural diversity of an ensemble of 21 classifiers. This measure is mostly
applied in ecology, whereby species counts are used as a measure of diversity.
The measures used were Shannon entropy, Simpsons and the Berger Parker
diversity indexes. As... |
0810.3564 | The Poisson Channel at Low Input Powers | cs.IT math.IT | The asymptotic capacity at low input powers of an average-power limited or an
average- and peak-power limited discrete-time Poisson channel is considered.
For a Poisson channel whose dark current is zero or decays to zero linearly
with its average input power $E$, capacity scales like $E\log\frac{1}{E}$ for
small $E$... |
0810.3579 | Hierarchical Bag of Paths for Kernel Based Shape Classification | cs.CV | Graph kernels methods are based on an implicit embedding of graphs within a
vector space of large dimension. This implicit embedding allows to apply to
graphs methods which where until recently solely reserved to numerical data.
Within the shape classification framework, graphs are often produced by a
skeletonization... |
0810.3605 | A Minimum Relative Entropy Principle for Learning and Acting | cs.AI cs.LG | This paper proposes a method to construct an adaptive agent that is universal
with respect to a given class of experts, where each expert is an agent that
has been designed specifically for a particular environment. This adaptive
control problem is formalized as the problem of minimizing the relative entropy
of the a... |
0810.3631 | Approximating the Gaussian Multiple Description Rate Region Under
Symmetric Distortion Constraints | cs.IT math.IT | We consider multiple description coding for the Gaussian source with K
descriptions under the symmetric mean squared error distortion constraints, and
provide an approximate characterization of the rate region. We show that the
rate region can be sandwiched between two polytopes, between which the gap can
be upper bo... |
0810.3729 | Optimal codes in deletion and insertion metric | cs.IT cs.DM math.CO math.IT | We improve the upper bound of Levenshtein for the cardinality of a code of
length 4 capable of correcting single deletions over an alphabet of even size.
We also illustrate that the new upper bound is sharp. Furthermore we will
construct an optimal perfect code capable of correcting single deletions for
the same para... |
0810.3787 | Automorphisms of doubly-even self-dual binary codes | math.NT cs.IT math.IT | The automorphism group of a binary doubly-even self-dual code is always
contained in the alternating group. On the other hand, given a permutation
group $G$ of degree $n$ there exists a doubly-even self-dual $G$-invariant code
if and only if $n$ is a multiple of 8, every simple self-dual $\F_2G$-module
occurs with ev... |
0810.3827 | Comments on the Boundary of the Capacity Region of Multiaccess Fading
Channels | cs.IT math.IT | A modification is proposed for the formula known from the literature that
characterizes the boundary of the capacity region of Gaussian multiaccess
fading channels. The modified version takes into account potentially negative
arguments of the cumulated density function that would affect the accuracy of
the numerical ... |
0810.3828 | Quantum reinforcement learning | quant-ph cs.AI cs.LG | The key approaches for machine learning, especially learning in unknown
probabilistic environments are new representations and computation mechanisms.
In this paper, a novel quantum reinforcement learning (QRL) method is proposed
by combining quantum theory and reinforcement learning (RL). Inspired by the
state super... |
0810.3851 | Astronomical imaging: The theory of everything | astro-ph cs.CV physics.data-an | We are developing automated systems to provide homogeneous calibration
meta-data for heterogeneous imaging data, using the pixel content of the image
alone where necessary. Standardized and complete calibration meta-data permit
generative modeling: A good model of the sky through wavelength and time--that
is, a model... |
0810.3865 | Relationship between Diversity and Perfomance of Multiple Classifiers
for Decision Support | cs.AI | The paper presents the investigation and implementation of the relationship
between diversity and the performance of multiple classifiers on classification
accuracy. The study is critical as to build classifiers that are strong and can
generalize better. The parameters of the neural network within the committee
were ... |
0810.3891 | Control Theoretic Formulation of Capacity of Dynamic Electro Magnetic
Channels | cs.IT math.IT | In this paper nonhomogeneous deterministic and stochastic Maxwell equations
are used to rigorously formulate the capacity of electromagnetic channels such
as wave guides (cavities, coaxial cables etc). Both distributed, but localized,
and Dirichlet boundary data are considered as the potential input sources. We
prove... |
0810.3900 | On the Capacity and Diversity-Multiplexing Tradeoff of the Two-Way Relay
Channel | cs.IT math.IT | This paper considers a multiple input multiple output (MIMO) two-way relay
channel, where two nodes want to exchange data with each other using multiple
relays. An iterative algorithm is proposed to achieve the optimal achievable
rate region, when each relay employs an amplify and forward (AF) strategy.
The iterati... |
0810.3990 | To which extend is the "neural code" a metric ? | physics.bio-ph cs.NE physics.data-an q-bio.NC | Here is proposed a review of the different choices to structure spike trains,
using deterministic metrics. Temporal constraints observed in biological or
computational spike trains are first taken into account. The relation with
existing neural codes (rate coding, rank coding, phase coding, ..) is then
discussed. To ... |
0810.3992 | Introducing numerical bounds to improve event-based neural network
simulation | nlin.AO cs.NE nlin.CD q-bio.NC | Although the spike-trains in neural networks are mainly constrained by the
neural dynamics itself, global temporal constraints (refractoriness, time
precision, propagation delays, ..) are also to be taken into account. These
constraints are revisited in this paper in order to use them in event-based
simulation paradi... |
0810.4059 | Network Coding-based Protection Strategies Against a Single Link Failure
in Optical Networks | cs.IT cs.NI math.IT | In this paper we develop network protection strategies against a single link
failure in optical networks. The motivation behind this work is the fact that
$%70$ of all available links in an optical network suffers from a single link
failure. In the proposed protection strategies, denoted NPS-I and NPS-II, we
deploy n... |
0810.4112 | Sums of residues on algebraic surfaces and application to coding theory | math.AG cs.IT math.IT | In this paper, we study residues of differential 2-forms on a smooth
algebraic surface over an arbitrary field and give several statements about
sums of residues. Afterwards, using these results we construct
algebraic-geometric codes which are an extension to surfaces of the well-known
differential codes on curves. W... |
0810.4171 | Capacity of Steganographic Channels | cs.CR cs.IT math.IT | This work investigates a central problem in steganography, that is: How much
data can safely be hidden without being detected? To answer this question, a
formal definition of steganographic capacity is presented. Once this has been
defined, a general formula for the capacity is developed. The formula is
applicable to... |
0810.4182 | Bucketing Coding and Information Theory for the Statistical High
Dimensional Nearest Neighbor Problem | cs.IT math.IT | Consider the problem of finding high dimensional approximate nearest
neighbors, where the data is generated by some known probabilistic model. We
will investigate a large natural class of algorithms which we call bucketing
codes. We will define bucketing information, prove that it bounds the
performance of all bucket... |
0810.4188 | A Heterogeneous High Dimensional Approximate Nearest Neighbor Algorithm | cs.IT math.IT | We consider the problem of finding high dimensional approximate nearest
neighbors. Suppose there are d independent rare features, each having its own
independent statistics. A point x will have x_{i}=0 denote the absence of
feature i, and x_{i}=1 its existence. Sparsity means that usually x_{i}=0.
Distance between po... |
0810.4341 | Entropy of Hidden Markov Processes via Cycle Expansion | cs.IT cond-mat.other math.IT physics.data-an | Hidden Markov Processes (HMP) is one of the basic tools of the modern
probabilistic modeling. The characterization of their entropy remains however
an open problem. Here the entropy of HMP is calculated via the cycle expansion
of the zeta-function, a method adopted from the theory of dynamical systems.
For a class of... |
0810.4366 | Resource Allocation and Relay Selection for Collaborative Communications | cs.IT math.IT | We investigate the relay selection problem for a decode and forward
collaborative network. Users are able to collaborate; decode messages of each
other, re-encode and forward along with their own messages. We study the
performance obtained from collaboration in terms of 1) increasing the
achievable rate, 2) saving th... |
0810.4401 | Efficient Exact Inference in Planar Ising Models | cs.LG cs.CV stat.ML | We give polynomial-time algorithms for the exact computation of lowest-energy
(ground) states, worst margin violators, log partition functions, and marginal
edge probabilities in certain binary undirected graphical models. Our approach
provides an interesting alternative to the well-known graph cut paradigm in
that i... |
0810.4404 | Non binary LDPC codes over the binary erasure channel: density evolution
analysis | cs.IT math.IT | In this paper we present a thorough analysis of non binary LDPC codes over
the binary erasure channel. First, the decoding of non binary LDPC codes is
investigated. The proposed algorithm performs on-the-fly decoding, i.e. it
starts decoding as soon as the first symbols are received, which generalizes
the erasure dec... |
0810.4426 | Camera distortion self-calibration using the plumb-line constraint and
minimal Hough entropy | cs.CV | In this paper we present a simple and robust method for self-correction of
camera distortion using single images of scenes which contain straight lines.
Since the most common distortion can be modelled as radial distortion, we
illustrate the method using the Harris radial distortion model, but the method
is applicabl... |
0810.4442 | Message passing resource allocation for the uplink of multicarrier
systems | cs.IT math.IT | We propose a novel distributed resource allocation scheme for the up-link of
a cellular multi-carrier system based on the message passing (MP) algorithm. In
the proposed approach each transmitter iteratively sends and receives
information messages to/from the base station with the goal of achieving an
optimal resourc... |
0810.4460 | Logics for XML | cs.PL cs.DB cs.LO | This thesis describes the theoretical and practical foundations of a system
for the static analysis of XML processing languages. The system relies on a
fixpoint temporal logic with converse, derived from the mu-calculus, where
models are finite trees. This calculus is expressive enough to capture regular
tree types a... |
0810.4611 | Learning Isometric Separation Maps | cs.LG | Maximum Variance Unfolding (MVU) and its variants have been very successful
in embedding data-manifolds in lower dimensional spaces, often revealing the
true intrinsic dimension. In this paper we show how to also incorporate
supervised class information into an MVU-like method without breaking its
convexity. We call ... |
0810.4616 | Assembling Actor-based Mind-Maps from Text Stream | cs.CL cs.DL | For human beings, the processing of text streams of unknown size leads
generally to problems because e.g. noise must be selected out, information be
tested for its relevance or redundancy, and linguistic phenomenon like
ambiguity or the resolution of pronouns be advanced. Putting this into
simulation by using an arti... |
0810.4617 | Graph-based classification of multiple observation sets | cs.CV | We consider the problem of classification of an object given multiple
observations that possibly include different transformations. The possible
transformations of the object generally span a low-dimensional manifold in the
original signal space. We propose to take advantage of this manifold structure
for the effecti... |
0810.4657 | Cooperative Strategies for the Half-Duplex Gaussian Parallel Relay
Channel: Simultaneous Relaying versus Successive Relaying | cs.IT math.IT | This study investigates the problem of communication for a network composed
of two half-duplex parallel relays with additive white Gaussian noise. Two
protocols, i.e., \emph{Simultaneous} and \emph{Successive} relaying, associated
with two possible relay orderings are proposed. The simultaneous relaying
protocol is b... |
0810.4658 | Indexability of Restless Bandit Problems and Optimality of Whittle's
Index for Dynamic Multichannel Access | cs.IT math.IT | We consider a class of restless multi-armed bandit problems (RMBP) that
arises in dynamic multichannel access, user/server scheduling, and optimal
activation in multi-agent systems. For this class of RMBP, we establish the
indexability and obtain Whittle's index in closed-form for both discounted and
average reward c... |
0810.4668 | On Granular Knowledge Structures | cs.AI cs.DL | Knowledge plays a central role in human and artificial intelligence. One of
the key characteristics of knowledge is its structured organization. Knowledge
can be and should be presented in multiple levels and multiple views to meet
people's needs in different levels of granularities and from different
perspectives. I... |
0810.4727 | Robust Estimation of Mean Values | math.ST cs.SY math.PR stat.CO stat.TH | In this paper, we develop a computational approach for estimating the mean
value of a quantity in the presence of uncertainty. We demonstrate that, under
some mild assumptions, the upper and lower bounds of the mean value are
efficiently computable via a sample reuse technique, of which the computational
complexity i... |
0810.4741 | On the Capacity and Generalized Degrees of Freedom of the X Channel | cs.IT math.IT | We explore the capacity and generalized degrees of freedom of the two-user
Gaussian X channel, i.e. a generalization of the 2 user interference channel
where there is an independent message from each transmitter to each receiver.
There are three main results in this paper. First, we characterize the sum
capacity of t... |
0810.4809 | XQuery Join Graph Isolation | cs.DB | A purely relational account of the true XQuery semantics can turn any
relational database system into an XQuery processor. Compiling nested
expressions of the fully compositional XQuery language, however, yields odd
algebraic plan shapes featuring scattered distributions of join operators that
currently overwhelm com... |
0810.4884 | The adaptability of physiological systems optimizes performance: new
directions in augmentation | cs.HC cs.NE | This paper contributes to the human-machine interface community in two ways:
as a critique of the closed-loop AC (augmented cognition) approach, and as a
way to introduce concepts from complex systems and systems physiology into the
field. Of particular relevance is a comparison of the inverted-U (or Gaussian)
model ... |
0810.4916 | Sequential adaptive compressed sampling via Huffman codes | cs.IT math.IT | There are two main approaches in compressed sensing: the geometric approach
and the combinatorial approach. In this paper we introduce an information
theoretic approach and use results from the theory of Huffman codes to
construct a sequence of binary sampling vectors to determine a sparse signal.
Unlike other approa... |
0810.4952 | Computational modelling of evolution: ecosystems and language | q-bio.PE cs.CL physics.soc-ph | Recently, computational modelling became a very important research tool that
enables us to study problems that for decades evaded scientific analysis.
Evolutionary systems are certainly examples of such problems: they are composed
of many units that might reproduce, diffuse, mutate, die, or in some cases for
example ... |
0810.4993 | New completely regular q-ary codes based on Kronecker products | cs.IT cs.DM math.CO math.IT | For any integer $\rho \geq 1$ and for any prime power q, the explicit
construction of a infinite family of completely regular (and completely
transitive) q-ary codes with d=3 and with covering radius $\rho$ is given. The
intersection array is also computed. Under the same conditions, the explicit
construction of an i... |
0810.5057 | Combining Advanced Visualization and Automatized Reasoning for
Webometrics: A Test Study | cs.IR cs.DL | This paper presents a first attempt at performing a precise and automatic
identification of the linking behaviour in a scientific domain through the
analysis of the communication of the related academic institutions on the web.
The proposed approach is based on the paradigm of multiple viewpoint data
analysis (MVDA) ... |
0810.5064 | A New Algorithm for Building Alphabetic Minimax Trees | cs.IT cs.DS math.IT | We show how to build an alphabetic minimax tree for a sequence (W = w_1,
>..., w_n) of real weights in (O (n d \log \log n)) time, where $d$ is the
number of distinct integers (\lceil w_i \rceil). We apply this algorithm to
building an alphabetic prefix code given a sample.
|
0810.5090 | Power-Bandwidth Tradeoff in Multiuser Relay Channels with Opportunistic
Scheduling | cs.IT math.IT | The goal of this paper is to understand the key merits of multihop relaying
techniques jointly in terms of their energy efficiency and spectral efficiency
advantages in the presence of multiuser diversity gains from opportunistic
(i.e., channel-aware) scheduling and identify the regimes and conditions in
which relay-... |
0810.5098 | Reliability Bounds for Delay-Constrained Multi-hop Networks | cs.IT math.IT | We consider a linear multi-hop network composed of multi-state discrete-time
memoryless channels over each hop, with orthogonal time-sharing across hops
under a half-duplex relaying protocol. We analyze the probability of error and
associated reliability function \cite{Gallager68} over the multi-hop network;
with emp... |
0810.5148 | Scheduling Kalman Filters in Continuous Time | math.OC cs.IT math.IT | A set of N independent Gaussian linear time invariant systems is observed by
M sensors whose task is to provide the best possible steady-state causal
minimum mean square estimate of the state of the systems, in addition to
minimizing a steady-state measurement cost. The sensors can switch between
systems instantaneou... |
0810.5203 | Monotonic Convergence in an Information-Theoretic Law of Small Numbers | cs.IT math.IT math.PR | An "entropy increasing to the maximum" result analogous to the entropic
central limit theorem (Barron 1986; Artstein et al. 2004) is obtained in the
discrete setting. This involves the thinning operation and a Poisson limit.
Monotonic convergence in relative entropy is established for general discrete
distributions, ... |
0810.5308 | Typical Performance of Irregular Low-Density Generator-Matrix Codes for
Lossy Compression | cond-mat.dis-nn cs.IT math.IT | We evaluate typical performance of irregular low-density generator-matrix
(LDGM) codes, which is defined by sparse matrices with arbitrary irregular bit
degree distribution and arbitrary check degree distribution, for lossy
compression. We apply the replica method under one-step replica symmetry
breaking (1RSB) ansat... |
0810.5325 | 3D Face Recognition with Sparse Spherical Representations | cs.CV | This paper addresses the problem of 3D face recognition using simultaneous
sparse approximations on the sphere. The 3D face point clouds are first aligned
with a novel and fully automated registration process. They are then
represented as signals on the 2D sphere in order to preserve depth and geometry
information. N... |
0810.5399 | An axiomatic characterization of a two-parameter extended relative
entropy | cond-mat.stat-mech cs.IT math.IT | The uniqueness theorem for a two-parameter extended relative entropy is
proven. This result extends our previous one, the uniqueness theorem for a
one-parameter extended relative entropy, to a two-parameter case. In addition,
the properties of a two-parameter extended relative entropy are studied.
|
0810.5407 | Quasi-metrics, Similarities and Searches: aspects of geometry of protein
datasets | cs.IR math.GN q-bio.QM | A quasi-metric is a distance function which satisfies the triangle inequality
but is not symmetric: it can be thought of as an asymmetric metric. The central
result of this thesis, developed in Chapter 3, is that a natural correspondence
exists between similarity measures between biological (nucleotide or protein)
se... |
0810.5428 | Relating Web pages to enable information-gathering tasks | cs.IR cs.DS | We argue that relationships between Web pages are functions of the user's
intent. We identify a class of Web tasks - information-gathering - that can be
facilitated by a search engine that provides links to pages which are related
to the page the user is currently viewing. We define three kinds of intentional
relatio... |
0810.5484 | A Novel Clustering Algorithm Based on a Modified Model of Random Walk | cs.LG cs.AI cs.MA | We introduce a modified model of random walk, and then develop two novel
clustering algorithms based on it. In the algorithms, each data point in a
dataset is considered as a particle which can move at random in space according
to the preset rules in the modified model. Further, this data point may be also
viewed as ... |
0810.5535 | A Combinatorial-Probabilistic Diagnostic Entropy and Information | cs.IT math.IT | A new combinatorial-probabilistic diagnostic entropy has been introduced. It
describes the pair-wise sum of probabilities of system conditions that have to
be distinguished during the diagnosing process. The proposed measure describes
the uncertainty of the system conditions, and at the same time complexity of
the di... |
0810.5551 | A Theory of Truncated Inverse Sampling | math.ST cs.LG math.PR stat.ME stat.TH | In this paper, we have established a new framework of truncated inverse
sampling for estimating mean values of non-negative random variables such as
binomial, Poisson, hyper-geometrical, and bounded variables. We have derived
explicit formulas and computational methods for designing sampling schemes to
ensure prescri... |
0810.5573 | A branch-and-bound feature selection algorithm for U-shaped cost
functions | cs.CV cs.DS cs.LG | This paper presents the formulation of a combinatorial optimization problem
with the following characteristics: i.the search space is the power set of a
finite set structured as a Boolean lattice; ii.the cost function forms a
U-shaped curve when applied to any lattice chain. This formulation applies for
feature selec... |
0810.5578 | Anonymizing Graphs | cs.DB cs.DS | Motivated by recently discovered privacy attacks on social networks, we study
the problem of anonymizing the underlying graph of interactions in a social
network. We call a graph (k,l)-anonymous if for every node in the graph there
exist at least k other nodes that share at least l of its neighbors. We
consider two c... |
0810.5582 | Anonymizing Unstructured Data | cs.DB cs.DS | In this paper we consider the problem of anonymizing datasets in which each
individual is associated with a set of items that constitute private
information about the individual. Illustrative datasets include market-basket
datasets and search engine query logs. We formalize the notion of k-anonymity
for set-valued da... |
0810.5631 | Temporal Difference Updating without a Learning Rate | cs.LG cs.AI | We derive an equation for temporal difference learning from statistical
principles. Specifically, we start with the variational principle and then
bootstrap to produce an updating rule for discounted state value estimates. The
resulting equation is similar to the standard equation for temporal difference
learning wit... |
0810.5633 | Reconstructing Extended Perfect Binary One-Error-Correcting Codes from
Their Minimum Distance Graphs | cs.IT math.CO math.IT | The minimum distance graph of a code has the codewords as vertices and edges
exactly when the Hamming distance between two codewords equals the minimum
distance of the code. A constructive proof for reconstructibility of an
extended perfect binary one-error-correcting code from its minimum distance
graph is presented... |
0810.5636 | On the Possibility of Learning in Reactive Environments with Arbitrary
Dependence | cs.LG cs.AI cs.IT math.IT | We address the problem of reinforcement learning in which observations may
exhibit an arbitrary form of stochastic dependence on past observations and
actions, i.e. environments more general than (PO)MDPs. The task for an agent is
to attain the best possible asymptotic reward where the true generating
environment is ... |
0810.5663 | Effective Complexity and its Relation to Logical Depth | cs.IT math.IT | Effective complexity measures the information content of the regularities of
an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of
the disadvantages of Kolmogorov complexity, also known as algorithmic
information content. In this paper, we give a precise formal definition of
effective comple... |
0810.5717 | On the Conditional Independence Implication Problem: A Lattice-Theoretic
Approach | cs.AI cs.DM | A lattice-theoretic framework is introduced that permits the study of the
conditional independence (CI) implication problem relative to the class of
discrete probability measures. Semi-lattices are associated with CI statements
and a finite, sound and complete inference system relative to semi-lattice
inclusions is p... |
0810.5725 | A triangle-based logic for affine-invariant querying of spatial and
spatio-temporal data | cs.LO cs.DB | In spatial databases, incompatibilities often arise due to different choices
of origin or unit of measurement (e.g., centimeters versus inches). By
representing and querying the data in an affine-invariant manner, we can avoid
these incompatibilities.
In practice, spatial (resp., spatio-temporal) data is often repr... |
0810.5770 | From Multi-Keyholes to Measure of Correlation and Power Imbalance in
MIMO Channels: Outage Capacity Analysis | cs.IT math.IT | An information-theoretic analysis of a multi-keyhole channel, which includes
a number of statistically independent keyholes with possibly different
correlation matrices, is given. When the number of keyholes or/and the number
of Tx/Rx antennas is large, there is an equivalent Rayleigh-fading channel such
that the out... |
0811.0048 | Conjectural Equilibrium in Water-filling Games | cs.GT cs.MA | This paper considers a non-cooperative game in which competing users sharing
a frequency-selective interference channel selfishly optimize their power
allocation in order to improve their achievable rates. Previously, it was shown
that a user having the knowledge of its opponents' channel state information
can make f... |
0811.0113 | A Bayesian Framework for Opinion Updates | physics.soc-ph cs.MA nlin.AO | Opinion Dynamics lacks a theoretical basis. In this article, I propose to use
a decision-theoretic framework, based on the updating of subjective
probabilities, as that basis. We will see we get a basic tool for a better
understanding of the interaction between the agents in Opinion Dynamics
problems and for creating... |
0811.0123 | A computational model of affects | cs.AI cs.MA | This article provides a simple logical structure, in which affective concepts
(i.e. concepts related to emotions and feelings) can be defined. The set of
affects defined is similar to the set of emotions covered in the OCC model
(Ortony A., Collins A., and Clore G. L.: The Cognitive Structure of Emotions.
Cambridge U... |
0811.0131 | Balancing Exploration and Exploitation by an Elitist Ant System with
Exponential Pheromone Deposition Rule | cs.AI | The paper presents an exponential pheromone deposition rule to modify the
basic ant system algorithm which employs constant deposition rule. A stability
analysis using differential equation is carried out to find out the values of
parameters that make the ant system dynamics stable for both kinds of
deposition rule. ... |
0811.0134 | A Novel Parser Design Algorithm Based on Artificial Ants | cs.AI | This article presents a unique design for a parser using the Ant Colony
Optimization algorithm. The paper implements the intuitive thought process of
human mind through the activities of artificial ants. The scheme presented here
uses a bottom-up approach and the parsing program can directly use ambiguous or
redundan... |
0811.0136 | Extension of Max-Min Ant System with Exponential Pheromone Deposition
Rule | cs.AI | The paper presents an exponential pheromone deposition approach to improve
the performance of classical Ant System algorithm which employs uniform
deposition rule. A simplified analysis using differential equations is carried
out to study the stability of basic ant system dynamics with both exponential
and constant d... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.