id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0906.0052 | A Minimum Description Length Approach to Multitask Feature Selection | cs.LG cs.AI | Many regression problems involve not one but several response variables
(y's). Often the responses are suspected to share a common underlying
structure, in which case it may be advantageous to share information across
them; this is known as multitask learning. As a special case, we can use
multiple responses to bette... |
0906.0060 | A Walk in Facebook: Uniform Sampling of Users in Online Social Networks | cs.SI cs.NI physics.data-an physics.soc-ph stat.ME | Our goal in this paper is to develop a practical framework for obtaining a
uniform sample of users in an online social network (OSN) by crawling its
social graph. Such a sample allows to estimate any user property and some
topological properties as well. To this end, first, we consider and compare
several candidate c... |
0906.0065 | Managing Distributed MARF with SNMP | cs.DC cs.CV | The scope of this project's work focuses on the research and prototyping of
the extension of the Distributed MARF such that its services can be managed
through the most popular management protocol familiarly, SNMP. The rationale
behind SNMP vs. MARF's proprietary management protocols, is that can be
integrated with t... |
0906.0080 | Reverse method for labeling the information from semi-structured web
pages | cs.IR cs.DS | We propose a new technique to infer the structure and extract the tokens of
data from the semi-structured web sources which are generated using a
consistent template or layout with some implicit regularities. The attributes
are extracted and labeled reversely from the region of interest of targeted
contents. This is ... |
0906.0211 | Equations of States in Statistical Learning for a Nonparametrizable and
Regular Case | cs.LG | Many learning machines that have hierarchical structure or hidden variables
are now being used in information science, artificial intelligence, and
bioinformatics. However, several learning machines used in such fields are not
regular but singular statistical models, hence their generalization performance
is still le... |
0906.0231 | Solving $k$-Nearest Neighbor Problem on Multiple Graphics Processors | cs.IR cs.DS cs.NE | The recommendation system is a software system to predict customers' unknown
preferences from known preferences. In the recommendation system, customers'
preferences are encoded into vectors, and finding the nearest vectors to each
vector is an essential part. This vector-searching part of the problem is
called a $k$... |
0906.0247 | Coded Modulation with Mismatched CSIT over Block-Fading Channels | cs.IT math.IT | Reliable communication over delay-constrained block-fading channels with
discrete inputs and mismatched (imperfect) channel state information at the
transmitter (CSIT) is studied. The CSIT mismatch is modeled as Gaussian random
variables, whose variances decay as a power of the signal-to-noise ratio (SNR).
A special ... |
0906.0249 | Faster Projection in Sphere Decoding | cs.IT math.IT | Most of the calculations in standard sphere decoders are redundant, in the
sense that they either calculate quantities that are never used or calculate
some quantities more than once. A new method, which is applicable to lattices
as well as finite constellations, is proposed to avoid these redundant
calculations whil... |
0906.0252 | Progressive Processing of Continuous Range Queries in Hierarchical
Wireless Sensor Networks | cs.DB | In this paper, we study the problem of processing continuous range queries in
a hierarchical wireless sensor network. Contrasted with the traditional
approach of building networks in a "flat" structure using sensor devices of the
same capability, the hierarchical approach deploys devices of higher capability
in a hig... |
0906.0298 | Delay-Optimal Power and Precoder Adaptation for Multi-stream MIMO
Systems | cs.IT math.IT | In this paper, we consider delay-optimal MIMO precoder and power allocation
design for a MIMO Link in wireless fading channels. There are $L$ data streams
spatially multiplexed onto the MIMO link with heterogeneous packet arrivals and
delay requirements. The transmitter is assumed to have knowledge of the channel
sta... |
0906.0311 | Solar radiation forecasting using ad-hoc time series preprocessing and
neural networks | cs.AI cs.NA physics.data-an | In this paper, we present an application of neural networks in the renewable
energy domain. We have developed a methodology for the daily prediction of
global solar radiation on a horizontal surface. We use an ad-hoc time series
preprocessing and a Multi-Layer Perceptron (MLP) in order to predict solar
radiation at d... |
0906.0330 | Information-Theoretic Inequalities on Unimodular Lie Groups | cs.IT math-ph math.IT math.MP | Classical inequalities used in information theory such as those of de Bruijn,
Fisher, and Kullback carry over from the setting of probability theory on
Euclidean space to that of unimodular Lie groups. These are groups that posses
integration measures that are invariant under left and right shifts, which
means that e... |
0906.0434 | Total Variation, Adaptive Total Variation and Nonconvex Smoothly Clipped
Absolute Deviation Penalty for Denoising Blocky Images | cs.CV cs.NA stat.ME | The total variation-based image denoising model has been generalized and
extended in numerous ways, improving its performance in different contexts. We
propose a new penalty function motivated by the recent progress in the
statistical literature on high-dimensional variable selection. Using a
particular instantiation... |
0906.0470 | An optimal linear separator for the Sonar Signals Classification task | cs.LG | The problem of classifying sonar signals from rocks and mines first studied
by Gorman and Sejnowski has become a benchmark against which many learning
algorithms have been tested. We show that both the training set and the test
set of this benchmark are linearly separable, although with different
hyperplanes. Moreove... |
0906.0531 | Medium Access Control Protocols With Memory | cs.NI cs.IT math.IT | Many existing medium access control (MAC) protocols utilize past information
(e.g., the results of transmission attempts) to adjust the transmission
parameters of users. This paper provides a general framework to express and
evaluate distributed MAC protocols utilizing a finite length of memory for a
given form of fe... |
0906.0550 | On linear completely regular codes with covering radius $\rho=1$.
Construction and classification | cs.IT math.IT | Completely regular codes with covering radius $\rho=1$ must have minimum
distance $d\leq 3$. For $d=3$, such codes are perfect and their parameters are
well known. In this paper, the cases $d=1$ and $d=2$ are studied and completely
characterized when the codes are linear. Moreover, it is proven that all these
codes a... |
0906.0612 | Community detection in graphs | physics.soc-ph cond-mat.stat-mech cs.IR physics.bio-ph physics.comp-ph q-bio.QM | The modern science of networks has brought significant advances to our
understanding of complex systems. One of the most relevant features of graphs
representing real systems is community structure, or clustering, i. e. the
organization of vertices in clusters, with many edges joining vertices of the
same cluster and... |
0906.0651 | Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks | cs.DC cs.RO | We propose the first deterministic algorithm that tolerates up to $f$
byzantine faults in $3f+1$-sized networks and performs in the asynchronous
CORDA model. Our solution matches the previously established lower bound for
the semi-synchronous ATOM model on the number of tolerated Byzantine robots.
Our algorithm works... |
0906.0667 | Quality assessment of the MPEG-4 scalable video CODEC | cs.MM cs.CV | In this paper, the performance of the emerging MPEG-4 SVC CODEC is evaluated.
In the first part, a brief introduction on the subject of quality assessment
and the development of the MPEG-4 SVC CODEC is given. After that, the used test
methodologies are described in detail, followed by an explanation of the actual
tes... |
0906.0675 | Encoding models for scholarly literature | cs.CL | We examine the issue of digital formats for document encoding, archiving and
publishing, through the specific example of "born-digital" scholarly journal
articles. We will begin by looking at the traditional workflow of journal
editing and publication, and how these practices have made the transition into
the online ... |
0906.0684 | New Instability Results for High Dimensional Nearest Neighbor Search | cs.DB cs.IR | Consider a dataset of n(d) points generated independently from R^d according
to a common p.d.f. f_d with support(f_d) = [0,1]^d and sup{f_d([0,1]^d)}
growing sub-exponentially in d. We prove that: (i) if n(d) grows
sub-exponentially in d, then, for any query point q^d in [0,1]^d and any
epsilon>0, the ratio of the di... |
0906.0690 | Thinning, Entropy and the Law of Thin Numbers | cs.IT math.IT math.PR | Renyi's "thinning" operation on a discrete random variable is a natural
discrete analog of the scaling operation for continuous random variables. The
properties of thinning are investigated in an information-theoretic context,
especially in connection with information-theoretic inequalities related to
Poisson approxi... |
0906.0695 | On network coding for sum-networks | cs.IT math.IT | A directed acyclic network is considered where all the terminals need to
recover the sum of the symbols generated at all the sources. We call such a
network a sum-network. It is shown that there exists a solvably (and linear
solvably) equivalent sum-network for any multiple-unicast network, and thus for
any directed ... |
0906.0716 | Size dependent word frequencies and translational invariance of books | cs.CL physics.soc-ph | It is shown that a real novel shares many characteristic features with a null
model in which the words are randomly distributed throughout the text. Such a
common feature is a certain translational invariance of the text. Another is
that the functional form of the word-frequency distribution of a novel depends
on the... |
0906.0739 | Spectrum Sensing in Low SNR Regime via Stochastic Resonance | cs.IT math.IT | Spectrum sensing is essential in cognitive radio to enable dynamic spectrum
access. In many scenarios, primary user signal must be detected reliably in low
signal-to-noise ratio (SNR) regime under required sensing time. We propose to
use stochastic resonance, a nonlinear filter having certain resonance
frequency, to ... |
0906.0744 | Ergodic Fading Interference Channels: Sum-Capacity and Separability | cs.IT math.IT | The sum-capacity for specific sub-classes of ergodic fading Gaussian two-user
interference channels (IFCs) is developed under the assumption of perfect
channel state information at all transmitters and receivers. For the
sub-classes of uniformly strong (every fading state is strong) and ergodic very
strong two-sided ... |
0906.0798 | Single Neuron Memories and the Network's Proximity Matrix | cs.NE | This paper extends the treatment of single-neuron memories obtained by the
B-matrix approach. The spreading of the activity within the network is
determined by the network's proximity matrix which represents the separations
amongst the neurons through the neural pathways.
|
0906.0840 | Soft-Input Soft-Output Single Tree-Search Sphere Decoding | cs.IT math.IT | Soft-input soft-output (SISO) detection algorithms form the basis for
iterative decoding. The computational complexity of SISO detection often poses
significant challenges for practical receiver implementations, in particular in
the context of multiple-input multiple-output (MIMO) wireless communication
systems. In t... |
0906.0861 | Using Genetic Algorithms for Texts Classification Problems | cs.LG cs.NE | The avalanche quantity of the information developed by mankind has led to
concept of automation of knowledge extraction - Data Mining ([1]). This
direction is connected with a wide spectrum of problems - from recognition of
the fuzzy set to creation of search machines. Important component of Data
Mining is processing... |
0906.0872 | Fast Weak Learner Based on Genetic Algorithm | cs.LG cs.NE | An approach to the acceleration of parametric weak classifier boosting is
proposed. Weak classifier is called parametric if it has fixed number of
parameters and, so, can be represented as a point into multidimensional space.
Genetic algorithm is used instead of exhaustive search to learn parameters of
such classifie... |
0906.0885 | Mining Compressed Repetitive Gapped Sequential Patterns Efficiently | cs.DB cs.AI | Mining frequent sequential patterns from sequence databases has been a
central research topic in data mining and various efficient mining sequential
patterns algorithms have been proposed and studied. Recently, in many problem
domains (e.g, program execution traces), a novel sequential pattern mining
research, called... |
0906.0910 | On the Challenges of Collaborative Data Processing | cs.DB cs.HC | The last 30 years have seen the creation of a variety of electronic
collaboration tools for science and business. Some of the best-known
collaboration tools support text editing (e.g., wikis). Wikipedia's success
shows that large-scale collaboration can produce highly valuable content.
Meanwhile much structured data ... |
0906.0958 | On a Generalized Foster-Lyapunov Type Criterion for the Stability of
Multidimensional Markov chains with Applications to the Slotted-Aloha
Protocol with Finite Number of Queues | cs.IT cs.NI math.IT | In this paper, we generalize a positive recurrence criterion for
multidimensional discrete-time Markov chains over countable state spaces due to
Rosberg (JAP, Vol. 17, No. 3, 1980). We revisit the stability analysis of well
known slotted-Aloha protocol with finite number of queues. Under standard
modeling assumptions... |
0906.0964 | On Sparse Channel Estimation | cs.IT math.IT | Channel Estimation is an essential component in applications such as radar
and data communication. In multi path time varying environments, it is
necessary to estimate time-shifts, scale-shifts (the wideband equivalent of
Doppler-shifts), and the gains/phases of each of the multiple paths. With
recent advances in spa... |
0906.0997 | Division Algebras and Wireless Communication | math.RA cs.IT math.IT math.NT | We survey the recent use of division algebras in wireless communication.
|
0906.1079 | Modified Frame Reconstruction Algorithm for Compressive Sensing | cs.IT math.IT | Compressive sensing is a technique to sample signals well below the Nyquist
rate using linear measurement operators. In this paper we present an algorithm
for signal reconstruction given such a set of measurements. This algorithm
generalises and extends previous iterative hard thresholding algorithms and we
give suff... |
0906.1148 | Collaborative filtering based on multi-channel diffusion | cs.IR | In this paper, by applying a diffusion process, we propose a new index to
quantify the similarity between two users in a user-object bipartite graph. To
deal with the discrete ratings on objects, we use a multi-channel
representation where each object is mapped to several channels with the number
of channels being eq... |
0906.1166 | Comparison of Galled Trees | q-bio.PE cs.CE cs.DM q-bio.QM | Galled trees, directed acyclic graphs that model evolutionary histories with
isolated hybridization events, have become very popular due to both their
biological significance and the existence of polynomial time algorithms for
their reconstruction. In this paper we establish to which extent several
distance measures ... |
0906.1182 | The CIFF Proof Procedure for Abductive Logic Programming with
Constraints: Theory, Implementation and Experiments | cs.AI cs.LO | We present the CIFF proof procedure for abductive logic programming with
constraints, and we prove its correctness. CIFF is an extension of the IFF
proof procedure for abductive logic programming, relaxing the original
restrictions over variable quantification (allowedness conditions) and
incorporating a constraint s... |
0906.1189 | On the Throughput/Bit-Cost Tradeoff in CSMA Based Cooperative Networks | cs.IT cs.NI math.IT | Wireless local area networks (WLAN) still suffer from a severe performance
discrepancy between different users in the uplink. This is because of the
spatially varying channel conditions provided by the wireless medium.
Cooperative medium access control (MAC) protocols as for example CoopMAC were
proposed to mitigate ... |
0906.1244 | Generalised Pinsker Inequalities | cs.IT math.IT | We generalise the classical Pinsker inequality which relates variational
divergence to Kullback-Liebler divergence in two ways: we consider arbitrary
f-divergences in place of KL divergence, and we assume knowledge of a sequence
of values of generalised variational divergences. We then develop a best
possible inequal... |
0906.1339 | Error Exponents for Broadcast Channels with Degraded Message Sets | cs.IT math.IT | We consider a broadcast channel with a degraded message set, in which a
single transmitter sends a common message to two receivers and a private
message to one of the receivers only. The main goal of this work is to find new
lower bounds to the error exponents of the strong user, the one that should
decode both messa... |
0906.1360 | On the effectiveness of a binless entropy estimator for generalised
entropic forms | cs.IT cs.DS math.IT math.NA | In this manuscript we discuss the effectiveness of the Kozachenko-Leonenko
entropy estimator when generalised to cope with entropic forms customarily
applied to study systems evincing asymptotic scale invariance and dependence
(either linear or non-linear type). We show that when the variables are
independently and i... |
0906.1467 | Syntax is from Mars while Semantics from Venus! Insights from Spectral
Analysis of Distributional Similarity Networks | physics.data-an cs.CL | We study the global topology of the syntactic and semantic distributional
similarity networks for English through the technique of spectral analysis. We
observe that while the syntactic network has a hierarchical structure with
strong communities and their mixtures, the semantic network has several tightly
knit commu... |
0906.1487 | The Physics of Compressive Sensing and the Gradient-Based Recovery
Algorithms | cs.IT math.IT | The physics of compressive sensing (CS) and the gradient-based recovery
algorithms are presented. First, the different forms for CS are summarized.
Second, the physical meanings of coherence and measurement are given. Third,
the gradient-based recovery algorithms and their geometry explanations are
provided. Finally,... |
0906.1538 | On "A Novel Maximum Likelihood Decoding Algorithm for Orthogonal
Space-Time Block Codes" | cs.IT math.IT | The computational complexity of the Maximum Likelihood decoding algorithm in
[1], [2] for orthogonal space-time block codes is smaller than specified.
|
0906.1565 | Correcting a Fraction of Errors in Nonbinary Expander Codes with Linear
Programming | cs.IT math.IT | A linear-programming decoder for \emph{nonbinary} expander codes is
presented. It is shown that the proposed decoder has the maximum-likelihood
certificate properties. It is also shown that this decoder corrects any pattern
of errors of a relative weight up to approximately 1/4 \delta_A \delta_B (where
\delta_A and \... |
0906.1593 | On Defining 'I' "I logy" | cs.AI cs.LO | Could we define I? Throughout this article we give a negative answer to this
question. More exactly, we show that there is no definition for I in a certain
way. But this negative answer depends on our definition of definability. Here,
we try to consider sufficient generalized definition of definability. In the
middle... |
0906.1599 | Bits Through Deterministic Relay Cascades with Half-Duplex Constraint | cs.IT math.IT | Consider a relay cascade, i.e. a network where a source node, a sink node and
a certain number of intermediate source/relay nodes are arranged on a line and
where adjacent node pairs are connected by error-free (q+1)-ary pipes. Suppose
the source and a subset of the relays wish to communicate independent
information ... |
0906.1603 | Multiaccess Channels with State Known to One Encoder: Another Case of
Degraded Message Sets | cs.IT math.IT | We consider a two-user state-dependent multiaccess channel in which only one
of the encoders is informed, non-causally, of the channel states. Two
independent messages are transmitted: a common message transmitted by both the
informed and uninformed encoders, and an individual message transmitted by only
the uninform... |
0906.1618 | On the Statistics of Cognitive Radio Capacity in Shadowing and Fast
Fading Environments (Journal Version) | cs.IT math.IT | In this paper we consider the capacity of the cognitive radio channel in
different fading environments under a low interference regime. First we derive
the probability that the low interference regime holds under shadow fading as
well as Rayleigh and Rician fast fading conditions. We demonstrate that this is
the domi... |
0906.1673 | Knowledge Management in Economic Intelligence with Reasoning on Temporal
Attributes | cs.AI | People have to make important decisions within a time frame. Hence, it is
imperative to employ means or strategy to aid effective decision making.
Consequently, Economic Intelligence (EI) has emerged as a field to aid
strategic and timely decision making in an organization. In the course of
attaining this goal: it is... |
0906.1677 | Outage Behavior of Discrete Memoryless Channels (DMCs) Under Channel
Estimation Errors | cs.IT cs.DM math.IT | Communication systems are usually designed by assuming perfect channel state
information (CSI). However, in many practical scenarios, only a noisy estimate
of the channel is available, which may strongly differ from the true channel.
This imperfect CSI scenario is addressed by introducing the notion of
estimation-ind... |
0906.1694 | Toward a Category Theory Design of Ontological Knowledge Bases | cs.AI | I discuss (ontologies_and_ontological_knowledge_bases /
formal_methods_and_theories) duality and its category theory extensions as a
step toward a solution to Knowledge-Based Systems Theory. In particular I focus
on the example of the design of elements of ontologies and ontological
knowledge bases of next three elec... |
0906.1713 | Feature Reinforcement Learning: Part I: Unstructured MDPs | cs.LG cs.AI cs.IT math.IT | General-purpose, intelligent, learning agents cycle through sequences of
observations, actions, and rewards that are complex, uncertain, unknown, and
non-Markovian. On the other hand, reinforcement learning is well-developed for
small finite state Markov decision processes (MDPs). Up to now, extracting the
right stat... |
0906.1763 | Segmentation of Facial Expressions Using Semi-Definite Programming and
Generalized Principal Component Analysis | cs.CV | In this paper, we use semi-definite programming and generalized principal
component analysis (GPCA) to distinguish between two or more different facial
expressions. In the first step, semi-definite programming is used to reduce the
dimension of the image data and "unfold" the manifold which the data points
(correspon... |
0906.1814 | Large-Margin kNN Classification Using a Deep Encoder Network | cs.LG cs.AI | KNN is one of the most popular classification methods, but it often fails to
work well with inappropriate choice of distance metric or due to the presence
of numerous class-irrelevant features. Linear feature transformation methods
have been widely applied to extract class-relevant information to improve kNN
classifi... |
0906.1835 | Secret-Key Generation using Correlated Sources and Channels | cs.IT cs.CR math.IT | We study the problem of generating a shared secret key between two terminals
in a joint source-channel setup -- the sender communicates to the receiver over
a discrete memoryless wiretap channel and additionally the terminals have
access to correlated discrete memoryless source sequences. We establish lower
and upper... |
0906.1842 | Managing Requirement Volatility in an Ontology-Driven Clinical LIMS
Using Category Theory. International Journal of Telemedicine and Applications | cs.AI cs.MA | Requirement volatility is an issue in software engineering in general, and in
Web-based clinical applications in particular, which often originates from an
incomplete knowledge of the domain of interest. With advances in the health
science, many features and functionalities need to be added to, or removed
from, exist... |
0906.1845 | Towards Improving Validation, Verification, Crash Investigations, and
Event Reconstruction of Flight-Critical Systems with Self-Forensics | cs.SE cs.AI | This paper introduces a novel concept of self-forensics to complement the
standard autonomic self-CHOP properties of the self-managed systems, to be
specified in the Forensic Lucid language. We argue that self-forensics, with
the forensics taken out of the cybercrime domain, is applicable to
"self-dissection" for the... |
0906.1900 | How deals with discrete data for the reduction of simulation models
using neural network | cs.NE | Simulation is useful for the evaluation of a Master Production/distribution
Schedule (MPS). Also, the goal of this paper is the study of the design of a
simulation model by reducing its complexity. According to theory of
constraints, we want to build reduced models composed exclusively by
bottlenecks and a neural net... |
0906.1905 | The VOISE Algorithm: a Versatile Tool for Automatic Segmentation of
Astronomical Images | astro-ph.IM astro-ph.EP cs.CV physics.data-an stat.AP | The auroras on Jupiter and Saturn can be studied with a high sensitivity and
resolution by the Hubble Space Telescope (HST) ultraviolet (UV) and
far-ultraviolet (FUV) Space Telescope spectrograph (STIS) and Advanced Camera
for Surveys (ACS) instruments. We present results of automatic detection and
segmentation of Ju... |
0906.1980 | On Maximum a Posteriori Estimation of Hidden Markov Processes | cs.AI cond-mat.stat-mech cs.IT math.IT physics.data-an stat.ML | We present a theoretical analysis of Maximum a Posteriori (MAP) sequence
estimation for binary symmetric hidden Markov processes. We reduce the MAP
estimation to the energy minimization of an appropriately defined Ising spin
model, and focus on the performance of MAP as characterized by its accuracy and
the number of... |
0906.2027 | Matrix Completion from Noisy Entries | cs.LG stat.ML | Given a matrix M of low-rank, we consider the problem of reconstructing it
from noisy observations of a small, random subset of its entries. The problem
arises in a variety of applications, from collaborative filtering (the `Netflix
problem') to structure-from-motion and positioning. We study a low complexity
algorit... |
0906.2032 | Mapping Equivalence for Symbolic Sequences: Theory and Applications | cs.IT cs.NA math.FA math.IT | Processing of symbolic sequences represented by mapping of symbolic data into
numerical signals is commonly used in various applications. It is a
particularly popular approach in genomic and proteomic sequence analysis.
Numerous mappings of symbolic sequences have been proposed for various
applications. It is unclear... |
0906.2061 | On the Minimum Distance of Non Binary LDPC Codes | cs.IT math.IT | Minimum distance is an important parameter of a linear error correcting code.
For improved performance of binary Low Density Parity Check (LDPC) codes, we
need to have the minimum distance grow fast with n, the codelength. However,
the best we can hope for is a linear growth in dmin with n. For binary LDPC
codes, the... |
0906.2154 | From formulas to cirquents in computability logic | cs.LO cs.AI cs.CC math.LO | Computability logic (CoL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a
recently introduced semantical platform and ambitious program for redeveloping
logic as a formal theory of computability, as opposed to the formal theory of
truth that logic has more traditionally been. Its expressions represent
interactive... |
0906.2228 | Characterising equilibrium logic and nested logic programs: Reductions
and complexity | cs.LO cs.AI | Equilibrium logic is an approach to nonmonotonic reasoning that extends the
stable-model and answer-set semantics for logic programs. In particular, it
includes the general case of nested logic programs, where arbitrary Boolean
combinations are permitted in heads and bodies of rules, as special kinds of
theories. In ... |
0906.2252 | Dirty Paper Coding for the MIMO Cognitive Radio Channel with Imperfect
CSIT | cs.IT math.IT | A Dirty Paper Coding (DPC) based transmission scheme for the Gaussian
multiple-input multiple-output (MIMO) cognitive radio channel (CRC) is studied
when there is imperfect and perfect channel knowledge at the transmitters
(CSIT) and the receivers, respectively. In particular, the problem of
optimizing the sum-rate o... |
0906.2274 | A Neural Network Classifier of Volume Datasets | cs.GR cs.AI | Many state-of-the art visualization techniques must be tailored to the
specific type of dataset, its modality (CT, MRI, etc.), the recorded object or
anatomical region (head, spine, abdomen, etc.) and other parameters related to
the data acquisition process. While parts of the information (imaging modality
and acquis... |
0906.2369 | Properties of quasi-alphabetic tree bimorphisms | cs.CL cs.FL | We study the class of quasi-alphabetic relations, i.e., tree transformations
defined by tree bimorphisms with two quasi-alphabetic tree homomorphisms and a
regular tree language. We present a canonical representation of these
relations; as an immediate consequence, we get the closure under union. Also,
we show that t... |
0906.2372 | Bounds on the Rate of 2-D Bit-Stuffing Encoders | cs.IT math.IT | A method for bounding the rate of bit-stuffing encoders for 2-D constraints
is presented. Instead of considering the original encoder, we consider a
related one which is quasi-stationary. We use the quasi-stationary property in
order to formulate linear requirements that must hold on the probabilities of
the constrai... |
0906.2415 | Without a 'doubt'? Unsupervised discovery of downward-entailing
operators | cs.CL | An important part of textual inference is making deductions involving
monotonicity, that is, determining whether a given assertion entails
restrictions or relaxations of that assertion. For instance, the statement 'We
know the epidemic spread quickly' does not entail 'We know the epidemic spread
quickly via fleas', b... |
0906.2459 | Exact Indexing for Massive Time Series Databases under Time Warping
Distance | cs.DB cs.AI cs.IR | Among many existing distance measures for time series data, Dynamic Time
Warping (DTW) distance has been recognized as one of the most accurate and
suitable distance measures due to its flexibility in sequence alignment.
However, DTW distance calculation is computationally intensive. Especially in
very large time ser... |
0906.2509 | On $[[n,n-4,3]]_{q}$ Quantum MDS Codes for odd prime power $q$ | cs.IT math.IT | For each odd prime power $q$, let $4 \leq n\leq q^{2}+1$. Hermitian
self-orthogonal $[n,2,n-1]$ codes over $GF(q^{2})$ with dual distance three are
constructed by using finite field theory. Hence, $[[n,n-4,3]]_{q}$ quantum MDS
codes for $4 \leq n\leq q^{2}+1$ are obtained.
|
0906.2511 | Robust Rate-Adaptive Wireless Communication Using ACK/NAK-Feedback | cs.IT cs.NI math.IT | To combat the detrimental effects of the variability in wireless channels, we
consider cross-layer rate adaptation based on limited feedback. In particular,
based on limited feedback in the form of link-layer acknowledgements (ACK) and
negative acknowledgements (NAK), we maximize the physical-layer transmission
rate ... |
0906.2530 | Observed Universality of Phase Transitions in High-Dimensional Geometry,
with Implications for Modern Data Analysis and Signal Processing | math.ST cs.IT math.IT physics.data-an stat.CO stat.TH | We review connections between phase transitions in high-dimensional
combinatorial geometry and phase transitions occurring in modern
high-dimensional data analysis and signal processing. In data analysis, such
transitions arise as abrupt breakdown of linear model selection, robust data
fitting or compressed sensing r... |
0906.2547 | Superactivation of the Asymptotic Zero-Error Classical Capacity of a
Quantum Channel | quant-ph cs.IT math.IT | The zero-error classical capacity of a quantum channel is the asymptotic rate
at which it can be used to send classical bits perfectly, so that they can be
decoded with zero probability of error. We show that there exist pairs of
quantum channels, neither of which individually have any zero-error capacity
whatsoever ... |
0906.2582 | Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of
Slepian-Wolf Code | cs.IT math.IT | The privacy amplification is a technique to distill a secret key from a
random variable by a function so that the distilled key and eavesdropper's
random variable are statistically independent. There are three kinds of
security criteria for the key distilled by the privacy amplification: the
normalized divergence cri... |
0906.2603 | Hybrid Coding for Gaussian Broadcast Channels with Gaussian Sources | cs.IT math.IT | This paper considers a degraded Gaussian broadcast channel over which
Gaussian sources are to be communicated. When the sources are independent, this
paper shows that hybrid coding achieves the optimal distortion region, the same
as that of separate source and channel coding. It also shows that uncoded
transmission i... |
0906.2609 | Concatenate and Boost for Multiple Measurement Vector Problems | cs.IT math.IT | Multiple measurement vector (MMV) problem addresses the recovery of a set of
sparse signal vectors that share common non-zero support, and has emerged an
important topics in compressed sensing. Even though the fundamental performance
limit of recoverable sparsity level has been formally derived, conventional
algorith... |
0906.2635 | Bayesian History Reconstruction of Complex Human Gene Clusters on a
Phylogeny | cs.LG | Clusters of genes that have evolved by repeated segmental duplication present
difficult challenges throughout genomic analysis, from sequence assembly to
functional analysis. Improved understanding of these clusters is of utmost
importance, since they have been shown to be the source of evolutionary
innovation, and h... |
0906.2667 | The use of dynamic distance potential fields for pedestrian flow around
corners | cs.MA physics.soc-ph | This contribution investigates situations in pedestrian dynamics, where
trying to walk the shortest path leads to largely different results than trying
to walk the quickest path. A heuristic one-shot method to model the influence
of the will to walk the quickest path is introduced.
|
0906.2716 | Maximal digital straight segments and convergence of discrete geometric
estimators | cs.CV cs.CG cs.DM | Discrete geometric estimators approach geometric quantities on digitized
shapes without any knowledge of the continuous shape. A classical yet difficult
problem is to show that an estimator asymptotically converges toward the true
geometric quantity as the resolution increases. We study here the convergence
of local ... |
0906.2756 | Norms and Commitment for iOrgs(TM) Information Systems: Direct Logic(TM)
and Participatory Grounding Checking | cs.MA cs.LO cs.SE | The fundamental assumption of the Event Calculus is overly simplistic when it
comes to organizations in which time-varying properties have to be actively
maintained and managed in order to continue to hold and termination by another
action is not required for a property to no longer hold. I.e., if active
measures are... |
0906.2767 | Coding cells of digital spaces: a framework to write generic digital
topology algorithms | cs.DM cs.CV | This paper proposes a concise coding of the cells of n-dimensional finite
regular grids. It induces a simple, generic and efficient framework for
implementing classical digital topology data structures and algorithms.
Discrete subsets of multidimensional images (e.g. regions, digital surfaces,
cubical cell complexes)... |
0906.2770 | Combinatorial pyramids and discrete geometry for energy-minimizing
segmentation | cs.CV | This paper defines the basis of a new hierarchical framework for segmentation
algorithms based on energy minimization schemes. This new framework is based on
two formal tools. First, a combinatorial pyramid encode efficiently a hierarchy
of partitions. Secondly, discrete geometric estimators measure precisely some
im... |
0906.2812 | Partial randomness and dimension of recursively enumerable reals | cs.CC cs.IT math.IT math.LO | A real \alpha is called recursively enumerable ("r.e." for short) if there
exists a computable, increasing sequence of rationals which converges to
\alpha. It is known that the randomness of an r.e. real \alpha can be
characterized in various ways using each of the notions; program-size
complexity, Martin-L\"{o}f tes... |
0906.2819 | Disjoint LDPC Coding for Gaussian Broadcast Channels | cs.IT math.IT | Low-density parity-check (LDPC) codes have been used for communication over a
two-user Gaussian broadcast channel. It has been shown in the literature that
the optimal decoding of such system requires joint decoding of both user
messages at each user. Also, a joint code design procedure should be performed.
We propos... |
0906.2820 | Equalization for Non-Coherent UWB Systems with Approximate Semi-Definite
Programming | cs.IT math.IT | In this paper, we propose an approximate semi-definite programming framework
for demodulation and equalization of non-coherent ultra-wide-band communication
systems with inter-symbol-interference. It is assumed that the communication
systems follow non-linear second-order Volterra models. We formulate the
demodulatio... |
0906.2824 | What Does Artificial Life Tell Us About Death? | cs.AI cs.OH | Short philosophical essay
|
0906.2835 | Employing Wikipedia's Natural Intelligence For Cross Language
Information Retrieval | cs.IR cs.CL | In this paper we present a novel method for retrieving information in
languages other than that of the query. We use this technique in combination
with existing traditional Cross Language Information Retrieval (CLIR)
techniques to improve their results. This method has a number of advantages
over traditional techniqu... |
0906.2864 | Discussion of Twenty Questions Problem | cs.IT math.IT | Discuss several tricks for solving twenty question problems which in this
paper is depicted as a guessing game. Player tries to find a ball in twenty
boxes by asking as few questions as possible, and these questions are answered
by only "Yes" or "No". With the discussion, demonstration of source coding
methods is the... |
0906.2895 | Entropy Message Passing | cs.LG cs.IT math.IT | The paper proposes a new message passing algorithm for cycle-free factor
graphs. The proposed "entropy message passing" (EMP) algorithm may be viewed as
sum-product message passing over the entropy semiring, which has previously
appeared in automata theory. The primary use of EMP is to compute the entropy
of a model.... |
0906.2935 | AG codes on certain maximal curves | math.AG cs.IT math.IT | Algebraic Geometric codes associated to a recently discovered class of
maximal curves are investigated. As a result, some linear codes with better
parameters with respect to the previously known ones are discovered, and 70
improvements on MinT's tables are obtained.
|
0906.2997 | The Jewett-Krieger Construction for Tilings | math.DS cs.IT math.IT math.PR | Given a random distribution of impurities on a periodic crystal, an
equivalent uniquely ergodic tiling space is built, made of aperiodic,
repetitive tilings with finite local complexity, and with configurational
entropy close to the entropy of the impurity distribution. The construction is
the tiling analog of the Je... |
0906.3036 | Mnesors for automatic control | cs.AI | Mnesors are defined as elements of a semimodule over the min-plus integers.
This two-sorted structure is able to merge graduation properties of vectors and
idempotent properties of boolean numbers, which makes it appropriate for hybrid
systems. We apply it to the control of an inverted pendulum and design a full
logi... |
0906.3068 | Deformable Model with a Complexity Independent from Image Resolution | cs.CV | We present a parametric deformable model which recovers image components with
a complexity independent from the resolution of input images. The proposed
model also automatically changes its topology and remains fully compatible with
the general framework of deformable models. More precisely, the image space is
equipp... |
0906.3085 | Poset representation and similarity comparisons os systems in IR | cs.IR | In this paper we are using the poset representation to describe the complex
answers given by IR systems after a clustering and ranking processes. The
answers considered may be given by cartographical representations or by
thematic sub-lists of documents. The poset representation, with the graph
theory and the relatio... |
0906.3112 | Object-Relational Database Representations for Text Indexing | cs.IR cs.DB | One of the distinctive features of Information Retrieval systems comparing to
Database Management systems, is that they offer better compression for posting
lists, resulting in better I/O performance and thus faster query evaluation. In
this paper, we introduce database representations of the index that reduce the
si... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.