id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0709.4506 | Optimum Diversity-Multiplexing Tradeoff in the Multiple Relays Network | cs.IT math.IT | In this paper, a multiple-relay network in considered, in which $K$
single-antenna relays assist a single-antenna transmitter to communicate with a
single-antenna receiver in a half-duplex mode. A new Amplify and Forward (AF)
scheme is proposed for this network and is shown to achieve the optimum
diversity-multiplexi... |
0709.4513 | Scheduling and Pre-Conditioning in Multi-User MIMO TDD Systems | cs.IT math.IT | The downlink transmission in multi-user multiple-input multiple-output (MIMO)
systems has been extensively studied from both communication-theoretic and
information-theoretic perspectives. Most of these papers assume
perfect/imperfect channel knowledge. In general, the problem of channel
training and estimation is st... |
0709.4655 | Mining for trees in a graph is NP-complete | cs.DB cs.AI | Mining for trees in a graph is shown to be NP-complete.
|
0709.4669 | The Extended Edit Distance Metric | cs.IR | Similarity search is an important problem in information retrieval. This
similarity is based on a distance. Symbolic representation of time series has
attracted many researchers recently, since it reduces the dimensionality of
these high dimensional data objects. We propose a new distance metric that is
applied to sy... |
0709.4671 | Secrecy Capacity Region of a Multi-Antenna Gaussian Broadcast Channel
with Confidential Messages | cs.IT math.IT | In wireless data networks, communication is particularly susceptible to
eavesdropping due to its broadcast nature. Security and privacy systems have
become critical for wireless providers and enterprise networks. This paper
considers the problem of secret communication over the Gaussian broadcast
channel, where a mul... |
0710.0009 | Bio-linguistic transition and Baldwin effect in an evolutionary
naming-game model | cs.CL cond-mat.stat-mech cs.AI physics.soc-ph q-bio.PE | We examine an evolutionary naming-game model where communicating agents are
equipped with an evolutionarily selected learning ability. Such a coupling of
biological and linguistic ingredients results in an abrupt transition: upon a
small change of a model control parameter a poorly communicating group of
linguistical... |
0710.0013 | Lagrangian Relaxation for MAP Estimation in Graphical Models | cs.AI | We develop a general framework for MAP estimation in discrete and Gaussian
graphical models using Lagrangian relaxation techniques. The key idea is to
reformulate an intractable estimation problem as one defined on a more
tractable graph, but subject to additional constraints. Relaxing these
constraints gives a tract... |
0710.0043 | Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching | cs.CV | A recent paper \cite{CaeCaeSchBar06} proposed a provably optimal, polynomial
time method for performing near-isometric point pattern matching by means of
exact probabilistic inference in a chordal graphical model. Their fundamental
result is that the chordal graph in question is shown to be globally rigid,
implying t... |
0710.0105 | Zipf's Law and Avoidance of Excessive Synonymy | cs.CL physics.soc-ph | Zipf's law states that if words of language are ranked in the order of
decreasing frequency in texts, the frequency of a word is inversely
proportional to its rank. It is very robust as an experimental observation, but
to date it escaped satisfactory theoretical explanation. We suggest that Zipf's
law may arise from ... |
0710.0116 | Distributed MIMO receiver - Achievable rates and upper bounds | cs.IT math.IT | In this paper we investigate the achievable rate of a system that includes a
nomadic transmitter with several antennas, which is received by multiple
agents, exhibiting independent channel gains and additive circular-symmetric
complex Gaussian noise. In the nomadic regime, we assume that the agents do not
have any de... |
0710.0142 | LDPC codes in the McEliece cryptosystem: attacks and countermeasures | cs.IT math.IT | The McEliece cryptosystem is a public-key cryptosystem based on coding theory
that has successfully resisted cryptanalysis for thirty years. The original
version, based on Goppa codes, is able to guarantee a high level of security,
and is faster than competing solutions, like RSA. Despite this, it has been
rarely con... |
0710.0169 | Evaluation experiments on related terms search in Wikipedia: Information
Content and Adapted HITS (In Russian) | cs.IR cs.CL | The classification of metrics and algorithms search for related terms via
WordNet, Roget's Thesaurus, and Wikipedia was extended to include adapted HITS
algorithm. Evaluation experiments on Information Content and adapted HITS
algorithm are described. The test collection of Russian word pairs with
human-assigned simi... |
0710.0192 | Binary quantization using Belief Propagation with decimation over factor
graphs of LDGM codes | cs.IT math.IT | We propose a new algorithm for binary quantization based on the Belief
Propagation algorithm with decimation over factor graphs of Low Density
Generator Matrix (LDGM) codes. This algorithm, which we call Bias Propagation
(BiP), can be considered as a special case of the Survey Propagation algorithm
proposed for binar... |
0710.0198 | Z4-Linear Perfect Codes | cs.IT math.IT | For every $n = 2^k > 8$ there exist exactly $[(k+1)/2]$ mutually
nonequivalent $Z_4$-linear extended perfect codes with distance 4. All these
codes have different ranks.
|
0710.0199 | Z4-linear Hadamard and extended perfect codes | cs.IT math.IT | If $N=2^k > 8$ then there exist exactly $[(k-1)/2]$ pairwise nonequivalent
$Z_4$-linear Hadamard $(N,2N,N/2)$-codes and $[(k+1)/2]$ pairwise nonequivalent
$Z_4$-linear extended perfect $(N,2^N/2N,4)$-codes. A recurrent construction of
$Z_4$-linear Hadamard codes is given.
|
0710.0213 | Optimising the topology of complex neural networks | cs.NE cs.AI | In this paper, we study instances of complex neural networks, i.e. neural
netwo rks with complex topologies. We use Self-Organizing Map neural networks
whose n eighbourhood relationships are defined by a complex network, to
classify handwr itten digits. We show that topology has a small impact on
performance and robu... |
0710.0225 | On the role of autocorrelations in texts | cs.CL | The task of finding a criterion allowing to distinguish a text from an
arbitrary set of words is rather relevant in itself, for instance, in the
aspect of development of means for internet-content indexing or separating
signals and noise in communication channels. The Zipf law is currently
considered to be the most r... |
0710.0228 | On the fractal nature of mutual relevance sequences in the Internet news
message flows | cs.CL | In the task of information retrieval the term relevance is taken to mean
formal conformity of a document given by the retrieval system to user's
information query. As a rule, the documents found by the retrieval system
should be submitted to the user in a certain order. Therefore, a retrieval
perceived as a selection... |
0710.0243 | High-Order Nonparametric Belief-Propagation for Fast Image Inpainting | cs.CV | In this paper, we use belief-propagation techniques to develop fast
algorithms for image inpainting. Unlike traditional gradient-based approaches,
which may require many iterations to converge, our techniques achieve
competitive results after only a few iterations. On the other hand, while
belief-propagation techniqu... |
0710.0244 | Theoretical Engineering and Satellite Comlink of a PTVD-SHAM System | cs.CE cs.AR | This paper focuses on super helical memory system's design, 'Engineering,
Architectural and Satellite Communications' as a theoretical approach of an
invention-model to 'store time-data'. The current release entails three
concepts: 1- an in-depth theoretical physics engineering of the chip including
its, 2- architect... |
0710.0262 | Incomplete Lineage Sorting: Consistent Phylogeny Estimation From
Multiple Loci | q-bio.PE cs.CE cs.DS math.PR math.ST stat.TH | We introduce a simple algorithm for reconstructing phylogenies from multiple
gene trees in the presence of incomplete lineage sorting, that is, when the
topology of the gene trees may differ from that of the species tree. We show
that our technique is statistically consistent under standard stochastic
assumptions, th... |
0710.0291 | On Outage Behavior of Wideband Slow-Fading Channels | cs.IT math.IT | This paper investigates point-to-point information transmission over a
wideband slow-fading channel, modeled as an (asymptotically) large number of
independent identically distributed parallel channels, with the random channel
fading realizations remaining constant over the entire coding block. On the one
hand, in th... |
0710.0410 | The Theory of Unified Relativity for a Biovielectroluminescence
Phenomenon via Fly's Visual and Imaging System | cs.CE cs.CV | The elucidation upon fly's neuronal patterns as a link to computer graphics
and memory cards I/O's, is investigated for the phenomenon by propounding a
unified theory of Einstein's two known relativities. It is conclusive that
flies could contribute a certain amount of neuromatrices indicating an imagery
function of ... |
0710.0431 | New Counting Codes for Distributed Video Coding | cs.IT math.IT | This paper introduces a new counting code. Its design was motivated by
distributed video coding where, for decoding, error correction methods are
applied to improve predictions. Those error corrections sometimes fail which
results in decoded values worse than the initial prediction. Our code exploits
the fact that bi... |
0710.0485 | Prediction with expert advice for the Brier game | cs.LG | We show that the Brier game of prediction is mixable and find the optimal
learning rate and substitution function for it. The resulting prediction
algorithm is applied to predict results of football and tennis matches. The
theoretical performance guarantee turns out to be rather tight on these data
sets, especially i... |
0710.0531 | The Problem of Localization in Networks of Randomly Deployed Nodes:
Asymptotic and Finite Analysis, and Thresholds | cs.DM cs.IT cs.NI math.IT | We derive the probability that a randomly chosen NL-node over $S$ gets
localized as a function of a variety of parameters. Then, we derive the
probability that the whole network of NL-nodes over $S$ gets localized. In
connection with the asymptotic thresholds, we show the presence of asymptotic
thresholds on the netw... |
0710.0556 | A Game Theoretic Approach to Quantum Information | quant-ph cs.GT cs.IT math.IT | This work is an application of game theory to quantum information. In a state
estimate, we are given observations distributed according to an unknown
distribution $P_{\theta}$ (associated with award $Q$), which Nature chooses at
random from the set $\{P_{\theta}: \theta \in \Theta \}$ according to a known
prior distr... |
0710.0564 | TP Decoding | cs.IT math.IT | `Tree pruning' (TP) is an algorithm for probabilistic inference on binary
Markov random fields. It has been recently derived by Dror Weitz and used to
construct the first fully polynomial approximation scheme for counting
independent sets up to the `tree uniqueness threshold.' It can be regarded as a
clever method fo... |
0710.0658 | Detailed Network Measurements Using Sparse Graph Counters: The Theory | cs.NI cs.IT math.IT | Measuring network flow sizes is important for tasks like accounting/billing,
network forensics and security. Per-flow accounting is considered hard because
it requires that many counters be updated at a very high speed; however, the
large fast memories needed for storing the counters are prohibitively
expensive. Ther... |
0710.0672 | Optimization of supply diversity for the self-assembly of simple objects
in two and three dimensions | cs.NE | The field of algorithmic self-assembly is concerned with the design and
analysis of self-assembly systems from a computational perspective, that is,
from the perspective of mathematical problems whose study may give insight into
the natural processes through which elementary objects self-assemble into more
complex on... |
0710.0736 | Colour image segmentation by the vector-valued Allen-Cahn phase-field
model: a multigrid solution | cs.CV cs.NA | We propose a new method for the numerical solution of a PDE-driven model for
colour image segmentation and give numerical examples of the results. The
method combines the vector-valued Allen-Cahn phase field equation with initial
data fitting terms. This method is known to be closely related to the
Mumford-Shah probl... |
0710.0865 | Secrecy Capacity of the Wiretap Channel with Noisy Feedback | cs.IT cs.CR math.IT | In this work, the role of noisy feedback in enhancing the secrecy capacity of
the wiretap channel is investigated. A model is considered in which the
feed-forward and feedback signals share the same noisy channel. More
specifically, a discrete memoryless modulo-additive channel with a full-duplex
destination node is ... |
0710.0900 | A New Achievability Scheme for the Relay Channel | cs.IT math.IT | In this paper, we propose a new coding scheme for the general relay channel.
This coding scheme is in the form of a block Markov code. The transmitter uses
a superposition Markov code. The relay compresses the received signal and maps
the compressed version of the received signal into a codeword conditioned on
the co... |
0710.0903 | Control and Monitoring System for Modular Wireless Robot | cs.RO | We introduce our concept on the modular wireless robot consisting of three
main modules : main unit, data acquisition and data processing modules. We have
developed a generic prototype with an integrated control and monitoring system
to enhance its flexibility, and to enable simple operation through a web-based
inter... |
0710.0937 | Multichannel algorithm based on generalized positional numeration system | cs.IT math.IT | This report is devoted to introduction in multichannel algorithm based on
generalized numeration notations (GPN). The internal, external and mixed
account are entered. The concept of the GPN and its classification as
decomposition of an integer on composed of integers is discussed. Realization
of multichannel algorit... |
0710.1001 | Connectivity of Random 1-Dimensional Networks | cs.IT cs.DS math.IT stat.AP | An important problem in wireless sensor networks is to find the minimal
number of randomly deployed sensors making a network connected with a given
probability. In practice sensors are often deployed one by one along a
trajectory of a vehicle, so it is natural to assume that arbitrary probability
density functions of... |
0710.1149 | Z2Z4-linear codes: generator matrices and duality | cs.IT cs.DM math.CO math.IT | A code ${\cal C}$ is $\Z_2\Z_4$-additive if the set of coordinates can be
partitioned into two subsets $X$ and $Y$ such that the punctured code of ${\cal
C}$ by deleting the coordinates outside $X$ (respectively, $Y$) is a binary
linear code (respectively, a quaternary linear code). In this paper
$\Z_2\Z_4$-additive ... |
0710.1182 | Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels | cs.IT math.IT | We solve the problem of designing powerful low-density parity-check (LDPC)
codes with iterative decoding for the block-fading channel. We first study the
case of maximum-likelihood decoding, and show that the design criterion is
rather straightforward. Unfortunately, optimal constructions for
maximum-likelihood decod... |
0710.1190 | Power Efficient Scheduling under Delay Constraints over Multi-user
Wireless Channels | cs.NI cs.MA | In this paper, we consider the problem of power efficient uplink scheduling
in a Time Division Multiple Access (TDMA) system over a fading wireless
channel. The objective is to minimize the power expenditure of each user
subject to satisfying individual user delay. We make the practical assumption
that the system sta... |
0710.1203 | Semantic distillation: a method for clustering objects by their
contextual specificity | math.PR cs.DB math.ST q-bio.QM stat.ML stat.TH | Techniques for data-mining, latent semantic analysis, contextual search of
databases, etc. have long ago been developed by computer scientists working on
information retrieval (IR). Experimental scientists, from all disciplines,
having to analyse large collections of raw experimental data (astronomical,
physical, bio... |
0710.1254 | A Group Theoretic Model for Information | cs.IT math.IT | In this paper we formalize the notions of information elements and
information lattices, first proposed by Shannon. Exploiting this formalization,
we identify a comprehensive parallelism between information lattices and
subgroup lattices. Qualitatively, we demonstrate isomorphisms between
information lattices and sub... |
0710.1275 | On Convergence Properties of Shannon Entropy | cs.IT math.IT | Convergence properties of Shannon Entropy are studied. In the differential
setting, it is shown that weak convergence of probability measures, or
convergence in distribution, is not enough for convergence of the associated
differential entropies. A general result for the desired differential entropy
convergence is pr... |
0710.1280 | On the Relationship between Mutual Information and Minimum Mean-Square
Errors in Stochastic Dynamical Systems | cs.IT math.IT | We consider a general stochastic input-output dynamical system with output
evolving in time as the solution to a functional coefficients, It\^{o}'s
stochastic differential equation, excited by an input process. This general
class of stochastic systems encompasses not only the classical communication
channel models, b... |
0710.1325 | The MIMOME Channel | cs.IT math.IT | The MIMOME channel is a Gaussian wiretap channel in which the sender,
receiver, and eavesdropper all have multiple antennas. We characterize the
secrecy capacity as the saddle-value of a minimax problem. Among other
implications, our result establishes that a Gaussian distribution maximizes the
secrecy capacity chara... |
0710.1336 | Multi-User Diversity vs. Accurate Channel Feedback for MIMO Broadcast
Channels | cs.IT math.IT | A multiple transmit antenna, single receive antenna (per receiver) downlink
channel with limited channel feedback is considered. Given a constraint on the
total system-wide channel feedback, the following question is considered: is it
preferable to get low-rate feedback from a large number of receivers or to
receive ... |
0710.1383 | Log-concavity property of the error probability with application to
local bounds for wireless communications | cs.IT math.IT | A clear understanding the behavior of the error probability (EP) as a
function of signal-to-noise ratio (SNR) and other system parameters is
fundamental for assessing the design of digital wireless communication
systems.We propose an analytical framework based on the log-concavity property
of the EP which we prove fo... |
0710.1385 | Cognitive Medium Access: Exploration, Exploitation and Competition | cs.IT cs.NI math.IT | This paper establishes the equivalence between cognitive medium access and
the competitive multi-armed bandit problem. First, the scenario in which a
single cognitive user wishes to opportunistically exploit the availability of
empty frequency bands in the spectrum with multiple bands is considered. In
this scenario,... |
0710.1404 | Performance Comparison of Persistence Frameworks | cs.DB cs.IR | One of the essential and most complex components in the software development
process is the database. The complexity increases when the "orientation" of the
interacting components differs. A persistence framework moves the program data
in its most natural form to and from a permanent data store, the database. Thus
a ... |
0710.1418 | Non-Archimedean Ergodic Theory and Pseudorandom Generators | math.DS cs.IT math.IT | The paper develops techniques in order to construct computer programs,
pseudorandom number generators (PRNG), that produce uniformly distributed
sequences. The paper exploits an approach that treats standard processor
instructions (arithmetic and bitwise logical ones) as continuous functions on
the space of 2-adic in... |
0710.1462 | Minimization of entropy functionals | math.OC cs.IT math.IT math.PR | Entropy functionals (i.e. convex integral functionals) and extensions of
these functionals are minimized on convex sets. This paper is aimed at reducing
as much as possible the assumptions on the constraint set. Dual equalities and
characterizations of the minimizers are obtained with weak constraint
qualifications.
|
0710.1467 | Weight Distributions of Hamming Codes | cs.IT math.IT math.NT | We derive a recursive formula determing the weight distribution of the
[n=(q^m-1)/(q-1), n-m, 3] Hamming code H(m,q), when (m, q-1)=1. Here q is a
prime power. The proof is based on Moisio's idea of using Pless power moment
identity together with exponential sum techniques.
|
0710.1469 | Weight Distributions of Hamming Codes (II) | cs.IT math.IT math.NT | In a previous paper, we derived a recursive formula determining the weight
distributions of the [n=(q^m-1)/(q-1)] Hamming code H(m,q), when (m,q-1)=1.
Here q is a prime power. We note here that the formula actually holds for any
positive integer m and any prime power q, without the restriction (m, q-1)=1.
|
0710.1481 | What's in a Name? | cs.CL cs.AI | This paper describes experiments on identifying the language of a single name
in isolation or in a document written in a different language. A new corpus has
been compiled and made available, matching names against languages. This corpus
is used in a series of experiments measuring the performance of general
language... |
0710.1511 | Demographic growth and the distribution of language sizes | physics.data-an cs.CL physics.soc-ph | It is argued that the present log-normal distribution of language sizes is,
to a large extent, a consequence of demographic dynamics within the population
of speakers of each language. A two-parameter stochastic multiplicative process
is proposed as a model for the population dynamics of individual languages, and
app... |
0710.1522 | Distributed spatial multiplexing with 1-bit feedback | cs.IT math.IT | We analyze a slow-fading interference network with MN non-cooperating
single-antenna sources and M non-cooperating single-antenna destinations. In
particular, we assume that the sources are divided into M mutually exclusive
groups of N sources each, every group is dedicated to transmit a common message
to a unique de... |
0710.1525 | Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics | cs.DS cs.IR | Minimal-interval semantics associates with each query over a document a set
of intervals, called witnesses, that are incomparable with respect to inclusion
(i.e., they form an antichain): witnesses define the minimal regions of the
document satisfying the query. Minimal-interval semantics makes it easy to
define and ... |
0710.1589 | Fast Reliability-based Algorithm of Finding Minimum-weight Codewords for
LDPC Codes | cs.IT math.IT | Despite the NP hardness of acquiring minimum distance $d_m$ for linear codes
theoretically, in this paper we propose one experimental method of finding
minimum-weight codewords, the weight of which is equal to $d_m$ for LDPC codes.
One existing syndrome decoding method, called serial belief propagation (BP)
with orde... |
0710.1595 | Analysis of Fixed Outage Transmission Schemes: A Finer Look at the Full
Multiplexing Point | cs.IT math.IT | This paper studies the performance of transmission schemes that have rate
that increases with average SNR while maintaining a fixed outage probability.
This is in contrast to the classical Zheng-Tse diversity-multiplexing tradeoff
(DMT) that focuses on increasing rate and decreasing outage probability. Three
differen... |
0710.1624 | Hamiltonian Formulation of Quantum Error Correction and Correlated
Noise: The Effects Of Syndrome Extraction in the Long Time Limit | quant-ph cond-mat.stat-mech cs.IT math.IT | We analyze the long time behavior of a quantum computer running a quantum
error correction (QEC) code in the presence of a correlated environment.
Starting from a Hamiltonian formulation of realistic noise models, and assuming
that QEC is indeed possible, we find formal expressions for the probability of
a faulty pat... |
0710.1626 | Throughput Scaling in Random Wireless Networks: A Non-Hierarchical
Multipath Routing Strategy | cs.IT math.IT | Franceschetti et al. have recently shown that per-node throughput in an
extended, ad hoc wireless network with $\Theta(n)$ randomly distributed nodes
and multihop routing can be increased from the $\Omega({1 \over \sqrt{n} \log
n})$ scaling demonstrated in the seminal paper of Gupta and Kumar to $\Omega({1
\over \sqr... |
0710.1870 | Lossless Representation of Graphs using Distributions | math.CO cs.CV | We consider complete graphs with edge weights and/or node weights taking
values in some set. In the first part of this paper, we show that a large
number of graphs are completely determined, up to isomorphism, by the
distribution of their sub-triangles. In the second part, we propose graph
representations in terms of... |
0710.1879 | Cyclotomic FFTs with Reduced Additive Complexities Based on a Novel
Common Subexpression Elimination Algorithm | cs.IT cs.CC math.CO math.IT | In this paper, we first propose a novel common subexpression elimination
(CSE) algorithm for matrix-vector multiplications over characteristic-2 fields.
As opposed to previously proposed CSE algorithms, which usually focus on
complexity savings due to recurrences of subexpressions, our CSE algorithm
achieves two type... |
0710.1916 | Evaluate the Word Error Rate of Binary Block Codes with Square Radius
Probability Density Function | cs.IT math.IT | The word error rate (WER) of soft-decision-decoded binary block codes rarely
has closed-form. Bounding techniques are widely used to evaluate the
performance of maximum-likelihood decoding algorithm. But the existing bounds
are not tight enough especially for low signal-to-noise ratios and become
looser when a subopt... |
0710.1920 | The Secrecy Capacity of the MIMO Wiretap Channel | cs.IT cs.CR math.IT | We consider the MIMO wiretap channel, that is a MIMO broadcast channel where
the transmitter sends some confidential information to one user which is a
legitimate receiver, while the other user is an eavesdropper. Perfect secrecy
is achieved when the the transmitter and the legitimate receiver can
communicate at some... |
0710.1924 | A Heuristic Routing Mechanism Using a New Addressing Scheme | cs.NI cs.AI | Current methods of routing are based on network information in the form of
routing tables, in which routing protocols determine how to update the tables
according to the network changes. Despite the variability of data in routing
tables, node addresses are constant. In this paper, we first introduce the new
concept o... |
0710.1949 | Distributed Source Coding Using Continuous-Valued Syndromes | cs.IT math.IT | This paper addresses the problem of coding a continuous random source
correlated with another source which is only available at the decoder. The
proposed approach is based on the extension of the channel coding concept of
syndrome from the discrete into the continuous domain. If the correlation
between the sources ca... |
0710.1962 | Stanford Matrix Considered Harmful | cs.IR | This note argues about the validity of web-graph data used in the literature.
|
0710.2018 | Cognitive Interference Channels with Confidential Messages | cs.IT math.IT | The cognitive interference channel with confidential messages is studied.
Similarly to the classical two-user interference channel, the cognitive
interference channel consists of two transmitters whose signals interfere at
the two receivers. It is assumed that there is a common message source (message
1) known to bot... |
0710.2037 | An Affinity Propagation Based method for Vector Quantization Codebook
Design | cs.CV | In this paper, we firstly modify a parameter in affinity propagation (AP) to
improve its convergence ability, and then, we apply it to vector quantization
(VQ) codebook design problem. In order to improve the quality of the resulted
codebook, we combine the improved AP (IAP) with the conventional LBG algorithm
to gen... |
0710.2083 | Association Rules in the Relational Calculus | cs.DB cs.LG cs.LO | One of the most utilized data mining tasks is the search for association
rules. Association rules represent significant relationships between items in
transactions. We extend the concept of association rule to represent a much
broader class of associations, which we refer to as \emph{entity-relationship
rules.} Seman... |
0710.2134 | Discrete entropies of orthogonal polynomials | math.CA cs.IT math-ph math.IT math.MP | Let $p_n$ be the $n$-th orthonormal polynomial on the real line, whose zeros
are $\lambda_j^{(n)}$, $j=1, ..., n$. Then for each $j=1, ..., n$, $$ \vec
\Psi_j^2 = (\Psi_{1j}^2, ..., \Psi_{nj}^2) $$ with $$ \Psi_{ij}^2= p_{i-1}^2
(\lambda_j^{(n)}) (\sum_{k=0}^{n-1} p_k^2(\lambda_j^{(n)}))^{-1}, \quad i=1,
>..., n, $$ ... |
0710.2156 | Collaborative OLAP with Tag Clouds: Web 2.0 OLAP Formalism and
Experimental Evaluation | cs.DB | Increasingly, business projects are ephemeral. New Business Intelligence
tools must support ad-lib data sources and quick perusal. Meanwhile, tag clouds
are a popular community-driven visualization technique. Hence, we investigate
tag-cloud views with support for OLAP operations such as roll-ups, slices,
dices, clust... |
0710.2227 | A System for Predicting Subcellular Localization of Yeast Genome Using
Neural Network | cs.NE cs.AI | The subcellular location of a protein can provide valuable information about
its function. With the rapid increase of sequenced genomic data, the need for
an automated and accurate tool to predict subcellular localization becomes
increasingly important. Many efforts have been made to predict protein
subcellular local... |
0710.2228 | Recommendation model based on opinion diffusion | physics.soc-ph cs.CY cs.IR physics.data-an | Information overload in the modern society calls for highly efficient
recommendation algorithms. In this letter we present a novel diffusion based
recommendation model, with users' ratings built into a transition matrix. To
speed up computation we introduce a Green function method. The numerical tests
on a benchmark ... |
0710.2231 | Comparison and Combination of State-of-the-art Techniques for
Handwritten Character Recognition: Topping the MNIST Benchmark | cs.CV | Although the recognition of isolated handwritten digits has been a research
topic for many years, it continues to be of interest for the research community
and for commercial applications. We show that despite the maturity of the
field, different approaches still deliver results that vary enough to allow
improvements... |
0710.2243 | Edge Local Complementation and Equivalence of Binary Linear Codes | math.CO cs.IT math.IT | Orbits of graphs under the operation edge local complementation (ELC) are
defined. We show that the ELC orbit of a bipartite graph corresponds to the
equivalence class of a binary linear code. The information sets and the minimum
distance of a code can be derived from the corresponding ELC orbit. By
extending earlier... |
0710.2268 | Complexity of some Path Problems in DAGs and Linear Orders | math.CO cs.IT math.IT | We investigate here the computational complexity of three natural problems in
directed acyclic graphs. We prove their NP Completeness and consider their
restrictions to linear orders.
|
0710.2446 | The structure of verbal sequences analyzed with unsupervised learning
techniques | cs.CL cs.AI cs.LG | Data mining allows the exploration of sequences of phenomena, whereas one
usually tends to focus on isolated phenomena or on the relation between two
phenomena. It offers invaluable tools for theoretical analyses and exploration
of the structure of sentences, texts, dialogues, and speech. We report here the
results o... |
0710.2496 | Regression estimation from an individual stable sequence | math.PR cs.IT math.IT math.ST stat.TH | We consider univariate regression estimation from an individual (non-random)
sequence $(x_1,y_1),(x_2,y_2), ... \in \real \times \real$, which is stable in
the sense that for each interval $A \subseteq \real$, (i) the limiting relative
frequency of $A$ under $x_1, x_2, ...$ is governed by an unknown probability
distr... |
0710.2500 | Density estimation from an individual numerical sequence | math.PR cs.IT math.IT math.ST stat.TH | This paper considers estimation of a univariate density from an individual
numerical sequence. It is assumed that (i) the limiting relative frequencies of
the numerical sequence are governed by an unknown density, and (ii) there is a
known upper bound for the variation of the density on an increasing sequence of
inte... |
0710.2553 | Capacity of Linear Two-hop Mesh Networks with Rate Splitting,
Decode-and-forward Relaying and Cooperation | cs.IT math.IT | A linear mesh network is considered in which a single user per cell
communicates to a local base station via a dedicated relay (two-hop
communication). Exploiting the possibly relevant inter-cell channel gains, rate
splitting with successive cancellation in both hops is investigated as a
promising solution to improve... |
0710.2604 | Efficient Skyline Querying with Variable User Preferences on Nominal
Attributes | cs.DB | Current skyline evaluation techniques assume a fixed ordering on the
attributes. However, dynamic preferences on nominal attributes are more
realistic in known applications. In order to generate online response for any
such preference issued by a user, we propose two methods of different
characteristics. The first on... |
0710.2611 | Geometric Analogue of Holographic Reduced Representation | cs.AI quant-ph | Holographic reduced representations (HRR) are based on superpositions of
convolution-bound $n$-tuples, but the $n$-tuples cannot be regarded as vectors
since the formalism is basis dependent. This is why HRR cannot be associated
with geometric structures. Replacing convolutions by geometric products one
arrives at re... |
0710.2659 | Rigidity and persistence for ensuring shape maintenance of multiagent
meta formations (ext'd version) | cs.MA cs.DM | This paper treats the problem of the merging of formations, where the
underlying model of a formation is graphical. We first analyze the rigidity and
persistence of meta-formations, which are formations obtained by connecting
several rigid or persistent formations. Persistence is a generalization to
directed graphs o... |
0710.2674 | Linguistic Information Energy | cs.CL cs.IT math.IT | In this treatment a text is considered to be a series of word impulses which
are read at a constant rate. The brain then assembles these units of
information into higher units of meaning. A classical systems approach is used
to model an initial part of this assembly process. The concepts of linguistic
system response... |
0710.2705 | Fingerprinting with Minimum Distance Decoding | cs.IT cs.CR math.IT | This work adopts an information theoretic framework for the design of
collusion-resistant coding/decoding schemes for digital fingerprinting. More
specifically, the minimum distance decision rule is used to identify 1 out of t
pirates. Achievable rates, under this detection rule, are characterized in two
distinct sce... |
0710.2782 | Effective linkage learning using low-order statistics and clustering | cs.NE cs.AI | The adoption of probabilistic models for the best individuals found so far is
a powerful approach for evolutionary computation. Increasingly more complex
models have been used by estimation of distribution algorithms (EDAs), which
often result better effectiveness on finding the global optima for hard
optimization pr... |
0710.2848 | Consistency of trace norm minimization | cs.LG | Regularization by the sum of singular values, also referred to as the trace
norm, is a popular technique for estimating low rank rectangular matrices. In
this paper, we extend some of the consistency results of the Lasso to provide
necessary and sufficient conditions for rank consistency of trace norm
minimization wi... |
0710.2852 | Generating models for temporal representations | cs.CL | We discuss the use of model building for temporal representations. We chose
Polish to illustrate our discussion because it has an interesting aspectual
system, but the points we wish to make are not language specific. Rather, our
goal is to develop theoretical and computational tools for temporal model
building tasks... |
0710.2889 | An efficient reduction of ranking to classification | cs.LG cs.IR | This paper describes an efficient reduction of the learning problem of
ranking to binary classification. The reduction guarantees an average pairwise
misranking regret of at most that of the binary classifier regret, improving a
recent result of Balcan et al which only guarantees a factor of 2. Moreover,
our reductio... |
0710.2988 | Using Description Logics for Recognising Textual Entailment | cs.CL | The aim of this paper is to show how we can handle the Recognising Textual
Entailment (RTE) task by using Description Logics (DLs). To do this, we propose
a representation of natural language semantics in DLs inspired by existing
representations in first-order logic. But our most significant contribution is
the defin... |
0710.3027 | Classical Capacities of Averaged and Compound Quantum Channels | quant-ph cs.IT math-ph math.IT math.MP | We determine the capacity of compound classical-quantum channels. As a
consequence we obtain the capacity formula for the averaged classical-quantum
channels. The capacity result for compound channels demonstrates, as in the
classical setting, the existence of reliable universal classical-quantum codes
in scenarios w... |
0710.3185 | Fuzzy Modeling of Electrical Impedance Tomography Image of the Lungs | cs.AI cs.CV | Electrical Impedance Tomography (EIT) is a functional imaging method that is
being developed for bedside use in critical care medicine. Aiming at improving
the chest anatomical resolution of EIT images we developed a fuzzy model based
on EIT high temporal resolution and the functional information contained in the
pul... |
0710.3246 | Bloom maps | cs.DS cs.IT math.IT | We consider the problem of succinctly encoding a static map to support
approximate queries. We derive upper and lower bounds on the space requirements
in terms of the error rate and the entropy of the distribution of values over
keys: our bounds differ by a factor log e. For the upper bound we introduce a
novel data ... |
0710.3279 | Resource Allocation for Delay Differentiated Traffic in Multiuser OFDM
Systems | cs.NI cs.IT math.IT | Most existing work on adaptive allocation of subcarriers and power in
multiuser orthogonal frequency division multiplexing (OFDM) systems has focused
on homogeneous traffic consisting solely of either delay-constrained data
(guaranteed service) or non-delay-constrained data (best-effort service). In
this paper, we in... |
0710.3283 | Effects of Non-Identical Rayleigh Fading on Differential Unitary
Space-Time Modulation | cs.PF cs.IT math.IT | This paper has been withdrawn by the author.
|
0710.3285 | Nontraditional Scoring of C-tests | cs.CY cs.CL | In C-tests the hypothesis of items local independence is violated, which
doesn't permit to consider them as real tests. It is suggested to determine the
distances between separate C-test items (blanks) and to combine items into
clusters. Weights, inversely proportional to the number of items in
corresponding clusters... |
0710.3375 | On the Capacity of Interference Channels with One Cooperating
Transmitter | cs.IT math.IT | Inner and outer bounds are established on the capacity region of two-sender,
two-receiver interference channels where one transmitter knows both messages.
The transmitter with extra knowledge is referred to as being cognitive. The
inner bound is based on strategies that generalize prior work, and include
rate-splitti... |
0710.3427 | Error Correction Capability of Column-Weight-Three LDPC Codes | cs.IT math.IT | In this paper, we investigate the error correction capability of
column-weight-three LDPC codes when decoded using the Gallager A algorithm. We
prove that the necessary condition for a code to correct $k \geq 5$ errors is
to avoid cycles of length up to $2k$ in its Tanner graph. As a consequence of
this result, we sh... |
0710.3502 | Using Synchronic and Diachronic Relations for Summarizing Multiple
Documents Describing Evolving Events | cs.CL cs.IR | In this paper we present a fresh look at the problem of summarizing evolving
events from multiple sources. After a discussion concerning the nature of
evolving events we introduce a distinction between linearly and non-linearly
evolving events. We present then a general methodology for the automatic
creation of summa... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.