id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0904.1193 | Coherence Analysis of Iterative Thresholding Algorithms | cs.IT math.IT | There is a recent surge of interest in developing algorithms for finding
sparse solutions of underdetermined systems of linear equations $y = \Phi x$.
In many applications, extremely large problem sizes are envisioned, with at
least tens of thousands of equations and hundreds of thousands of unknowns. For
such proble... |
0904.1227 | Learning convex bodies is hard | cs.LG cs.CG | We show that learning a convex body in $\RR^d$, given random samples from the
body, requires $2^{\Omega(\sqrt{d/\eps})}$ samples. By learning a convex body
we mean finding a set having at most $\eps$ relative symmetric difference with
the input body. To prove the lower bound we construct a hard to learn family of
con... |
0904.1229 | Finding an Unknown Acyclic Orientation of a Given Graph | math.CO cs.IT math.IT | Let c(G) be the smallest number of edges we have to test in order to
determine an unknown acyclic orientation of the given graph G in the worst
case. For example, if G is the complete graph on n vertices, then c(G) is the
smallest number of comparisons needed to sort n numbers.
We prove that c(G)\le (1/4+o(1))n^2 f... |
0904.1234 | Mapping the evolution of scientific fields | physics.soc-ph cs.DL cs.IR | Despite the apparent cross-disciplinary interactions among scientific fields,
a formal description of their evolution is lacking. Here we describe a novel
approach to study the dynamics and evolution of scientific fields using a
network-based analysis. We build an idea network consisting of American
Physical Society ... |
0904.1258 | An Investigation Report on Auction Mechanism Design | cs.AI cs.MA | Auctions are markets with strict regulations governing the information
available to traders in the market and the possible actions they can take.
Since well designed auctions achieve desirable economic outcomes, they have
been widely used in solving real-world optimization problems, and in
structuring stock or future... |
0904.1281 | Asymptotically Optimal Joint Source-Channel Coding with Minimal Delay | cs.IT math.IT | We present and analyze a joint source-channel coding strategy for the
transmission of a Gaussian source across a Gaussian channel in n channel uses
per source symbol. Among all such strategies, our scheme has the following
properties: i) the resulting mean-squared error scales optimally with the
signal-to-noise ratio... |
0904.1289 | Language Diversity across the Consonant Inventories: A Study in the
Framework of Complex Networks | cs.CL physics.comp-ph physics.soc-ph | n this paper, we attempt to explain the emergence of the linguistic diversity
that exists across the consonant inventories of some of the major language
families of the world through a complex network based growth model. There is
only a single parameter for this model that is meant to introduce a small
amount of rand... |
0904.1299 | On the Communication of Scientific Results: The Full-Metadata Format | cs.DL cs.IR physics.comp-ph physics.ins-det | In this paper, we introduce a scientific format for text-based data files,
which facilitates storing and communicating tabular data sets. The so-called
Full-Metadata Format builds on the widely used INI-standard and is based on
four principles: readable self-documentation, flexible structure, fail-safe
compatibility,... |
0904.1313 | A Class of Novel STAP Algorithms Using Sparse Recovery Technique | cs.IT math.IT | A class of novel STAP algorithms based on sparse recovery technique were
presented. Intrinsic sparsity of distribution of clutter and target energy on
spatial-frequency plane was exploited from the viewpoint of compressed sensing.
The original sample data and distribution of target and clutter energy was
connected by... |
0904.1331 | Primitive Polynomials, Singer Cycles, and Word-Oriented Linear Feedback
Shift Registers | math.CO cs.IT math.IT | Using the structure of Singer cycles in general linear groups, we prove that
a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special
case, and outline a plausible approach to prove it in the general case. This
conjecture is about the number of primitive $\sigma$-LFSRs of a given order
over a fin... |
0904.1366 | A Unified Approach to Ranking in Probabilistic Databases | cs.DB cs.DS | The dramatic growth in the number of application domains that naturally
generate probabilistic, uncertain data has resulted in a need for efficiently
supporting complex querying and decision-making over such data. In this paper,
we present a unified approach to ranking and top-k query processing in
probabilistic data... |
0904.1369 | Cooperative Transmission for Wireless Relay Networks Using Limited
Feedback | cs.IT math.IT | To achieve the available performance gains in half-duplex wireless relay
networks, several cooperative schemes have been earlier proposed using either
distributed space-time coding or distributed beamforming for the transmitter
without and with channel state information (CSI), respectively. However, these
schemes typ... |
0904.1409 | MIMO Downlink Scheduling with Non-Perfect Channel State Knowledge | cs.IT math.IT | Downlink scheduling schemes are well-known and widely investigated under the
assumption that the channel state is perfectly known to the scheduler. In the
multiuser MIMO (broadcast) case, downlink scheduling in the presence of
non-perfect channel state information (CSI) is only scantly treated. In this
paper we provi... |
0904.1444 | Spatial and Temporal Correlation of the Interference in ALOHA Ad Hoc
Networks | cs.IT cs.NI math.IT math.PR | Interference is a main limiting factor of the performance of a wireless ad
hoc network. The temporal and the spatial correlation of the interference makes
the outages correlated temporally (important for retransmissions) and spatially
correlated (important for routing). In this letter we quantify the temporal and
spa... |
0904.1446 | Concavity of entropy under thinning | cs.IT math.IT | Building on the recent work of Johnson (2007) and Yu (2008), we prove that
entropy is a concave function with respect to the thinning operation T_a. That
is, if X and Y are independent random variables on Z_+ with ultra-log-concave
probability mass functions, then H(T_a X+T_{1-a} Y)>= a H(X)+(1-a)H(Y), 0 <= a
<= 1, w... |
0904.1538 | Shannon-Kotel'nikov Mappings for Analog Point-to-Point Communications | cs.IT math.IT | In this paper an approach to joint source-channel coding (JSCC) named
Shannon-Kotel'nikov mappings (S-K mappings) is presented. S-K mappings are
continuous, or piecewise continuous direct source-to-channel mappings operating
directly on amplitude continuous and discrete time signals. Such mappings
include several exi... |
0904.1579 | Online prediction of ovarian cancer | cs.AI cs.LG | In this paper we apply computer learning methods to diagnosing ovarian cancer
using the level of the standard biomarker CA125 in conjunction with information
provided by mass-spectrometry. We are working with a new data set collected
over a period of 7 years. Using the level of CA125 and mass-spectrometry peaks,
our ... |
0904.1613 | On the closed-form solution of the rotation matrix arising in computer
vision problems | cs.CV | We show the closed-form solution to the maximization of trace(A'R), where A
is given and R is unknown rotation matrix. This problem occurs in many computer
vision tasks involving optimal rotation matrix estimation. The solution has
been continuously reinvented in different fields as part of specific problems.
We summ... |
0904.1629 | Fuzzy inference based mentality estimation for eye robot agent | cs.RO cs.AI cs.HC | Household robots need to communicate with human beings in a friendly fashion.
To achieve better understanding of displayed information, an importance and a
certainty of the information should be communicated together with the main
information. The proposed intent expression system aims to convey this
additional infor... |
0904.1631 | Intent expression using eye robot for mascot robot system | cs.RO cs.AI cs.HC | An intent expression system using eye robots is proposed for a mascot robot
system from a viewpoint of humatronics. The eye robot aims at providing a basic
interface method for an information terminal robot system. To achieve better
understanding of the displayed information, the importance and the degree of
certaint... |
0904.1672 | CP-logic: A Language of Causal Probabilistic Events and Its Relation to
Logic Programming | cs.AI cs.LO | This papers develops a logical language for representing probabilistic causal
laws. Our interest in such a language is twofold. First, it can be motivated as
a fundamental study of the representation of causal knowledge. Causality has an
inherent dynamic aspect, which has been studied at the semantical level by
Shafe... |
0904.1692 | Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming | cs.IT math.IT | We examine regular and irregular repeat-accumulate (RA) codes with repetition
degrees which are all even. For these codes and with a particular choice of an
interleaver, we give an upper bound on the decoding error probability of a
linear-programming based decoder which is an inverse polynomial in the block
length. O... |
0904.1700 | Recovering the state sequence of hidden Markov models using mean-field
approximations | cond-mat.dis-nn cond-mat.stat-mech cs.LG | Inferring the sequence of states from observations is one of the most
fundamental problems in Hidden Markov Models. In statistical physics language,
this problem is equivalent to computing the marginals of a one-dimensional
model with a random external field. While this task can be accomplished through
transfer matri... |
0904.1712 | Turbo Packet Combining for Broadband Space-Time BICM Hybrid-ARQ Systems
with Co-Channel Interference | cs.IT math.IT | In this paper, efficient turbo packet combining for single carrier (SC)
broadband multiple-input--multiple-output (MIMO) hybrid--automatic repeat
request (ARQ) transmission with unknown co-channel interference (CCI) is
studied. We propose a new frequency domain soft minimum mean square error
(MMSE)-based signal level... |
0904.1730 | Feedback-based online network coding | cs.NI cs.IT math.IT | Current approaches to the practical implementation of network coding are
batch-based, and often do not use feedback, except possibly to signal
completion of a file download. In this paper, the various benefits of using
feedback in a network coded system are studied. It is shown that network coding
can be performed in... |
0904.1812 | Two Designs of Space-Time Block Codes Achieving Full Diversity with
Partial Interference Cancellation Group Decoding | cs.IT math.IT | A partial interference cancellation (PIC) group decoding based space-time
block code (STBC) design criterion was recently proposed by Guo and Xia, where
the decoding complexity and the code rate trade-off is dealt when the full
diversity is achieved. In this paper, two designs of STBC are proposed for any
number of t... |
0904.1840 | Higher Dimensional Consensus: Learning in Large-Scale Networks | cs.IT cs.DC math.IT math.OC | The paper presents higher dimension consensus (HDC) for large-scale networks.
HDC generalizes the well-known average-consensus algorithm. It divides the
nodes of the large-scale network into anchors and sensors. Anchors are nodes
whose states are fixed over the HDC iterations, whereas sensors are nodes that
update th... |
0904.1888 | On Fodor on Darwin on Evolution | cs.NE cs.LG | Jerry Fodor argues that Darwin was wrong about "natural selection" because
(1) it is only a tautology rather than a scientific law that can support
counterfactuals ("If X had happened, Y would have happened") and because (2)
only minds can select. Hence Darwin's analogy with "artificial selection" by
animal breeders ... |
0904.1892 | Lattice Strategies for the Dirty Multiple Access Channel | cs.IT math.IT | A generalization of the Gaussian dirty-paper problem to a multiple access
setup is considered. There are two additive interference signals, one known to
each transmitter but none to the receiver. The rates achievable using Costa's
strategies (i.e. by a random binning scheme induced by Costa's auxiliary random
variabl... |
0904.1897 | Refined Coding Bounds and Code Constructions for Coherent Network Error
Correction | cs.IT math.IT | Coherent network error correction is the error-control problem in network
coding with the knowledge of the network codes at the source and sink nodes.
With respect to a given set of local encoding kernels defining a linear network
code, we obtain refined versions of the Hamming bound, the Singleton bound and
the Gilb... |
0904.1907 | Average Entropy Functions | cs.IT cs.RO math.IT | The closure of the set of entropy functions associated with n discrete
variables, Gammar*n, is a convex cone in (2n-1)- dimensional space, but its
full characterization remains an open problem. In this paper, we map Gammar*n
to an n-dimensional region Phi*n by averaging the joint entropies with the same
number of var... |
0904.1910 | Compressive Sampling with Known Spectral Energy Density | cs.IT cs.CE math.FA math.IT | A method to improve l1 performance of the CS (Compressive Sampling) for
A-scan SFCW-GPR (Stepped Frequency Continuous Wave-Ground Penetrating Radar)
signals with known spectral energy density is proposed. Instead of random
sampling, the proposed method selects the location of samples to follow the
distribution of the... |
0904.1931 | KiWi: A Scalable Subspace Clustering Algorithm for Gene Expression
Analysis | cs.DB cs.AI q-bio.GN | Subspace clustering has gained increasing popularity in the analysis of gene
expression data. Among subspace cluster models, the recently introduced
order-preserving sub-matrix (OPSM) has demonstrated high promise. An OPSM,
essentially a pattern-based subspace cluster, is a subset of rows and columns
in a data matrix... |
0904.1956 | Ergodic Layered Erasure One-Sided Interference Channels | cs.IT math.IT | The sum capacity of a class of layered erasure one-sided interference
channels is developed under the assumption of no channel state information at
the transmitters. Outer bounds are presented for this model and are shown to be
tight for the following sub-classes: i) weak, ii) strong (mix of strong but not
very stron... |
0904.1989 | Personalized Recommendation via Integrated Diffusion on User-Item-Tag
Tripartite Graphs | cs.IR | Personalized recommender systems are confronting great challenges of
accuracy, diversification and novelty, especially when the data set is sparse
and lacks accessorial information, such as user profiles, item attributes and
explicit ratings. Collaborative tags contain rich information about
personalized preferences ... |
0904.2012 | Simplicial Databases | cs.DB cs.IR | In this paper, we define a category DB, called the category of simplicial
databases, whose objects are databases and whose morphisms are data-preserving
maps. Along the way we give a precise formulation of the category of relational
databases, and prove that it is a full subcategory of DB. We also prove that
limits a... |
0904.2022 | Absdet-Pseudo-Codewords and Perm-Pseudo-Codewords: Definitions and
Properties | cs.IT cs.DM math.IT | The linear-programming decoding performance of a binary linear code crucially
depends on the structure of the fundamental cone of the parity-check matrix
that describes the code. Towards a better understanding of fundamental cones
and the vectors therein, we introduce the notion of absdet-pseudo-codewords and
perm-ps... |
0904.2037 | Boosting through Optimization of Margin Distributions | cs.LG cs.CV | Boosting has attracted much research attention in the past decade. The
success of boosting algorithms may be interpreted in terms of the margin
theory. Recently it has been shown that generalization error of classifiers can
be obtained by explicitly taking the margin distribution of the training data
into account. Mo... |
0904.2051 | Joint-sparse recovery from multiple measurements | cs.IT math.IT | The joint-sparse recovery problem aims to recover, from sets of compressed
measurements, unknown sparse matrices with nonzero entries restricted to a
subset of rows. This is an extension of the single-measurement-vector (SMV)
problem widely studied in compressed sensing. We analyze the recovery
properties for two typ... |
0904.2096 | A Distributed Software Architecture for Collaborative Teleoperation
based on a VR Platform and Web Application Interoperability | cs.HC cs.GR cs.MM cs.RO | Augmented Reality and Virtual Reality can provide to a Human Operator (HO) a
real help to complete complex tasks, such as robot teleoperation and
cooperative teleassistance. Using appropriate augmentations, the HO can
interact faster, safer and easier with the remote real world. In this paper, we
present an extension... |
0904.2160 | Inferring Dynamic Bayesian Networks using Frequent Episode Mining | cs.LG | Motivation: Several different threads of research have been proposed for
modeling and mining temporal data. On the one hand, approaches such as dynamic
Bayesian networks (DBNs) provide a formal probabilistic basis to model
relationships between time-indexed random variables but these models are
intractable to learn i... |
0904.2237 | On Binary Cyclic Codes with Five Nonzero Weights | cs.IT cs.DM math.CO math.IT | Let $q=2^n$, $0\leq k\leq n-1$, $n/\gcd(n,k)$ be odd and $k\neq n/3, 2n/3$.
In this paper the value distribution of following exponential sums
\[\sum\limits_{x\in \bF_q}(-1)^{\mathrm{Tr}_1^n(\alpha x^{2^{2k}+1}+\beta
x^{2^k+1}+\ga x)}\quad(\alpha,\beta,\ga\in \bF_{q})\] is determined. As an
application, the weight di... |
0904.2302 | A Fundamental Characterization of Stability in Broadcast Queueing
Systems | cs.NI cs.IT math.IT | Stability with respect to a given scheduling policy has become an important
issue for wireless communication systems, but it is hard to prove in particular
scenarios. In this paper two simple conditions for stability in broadcast
channels are derived, which are easy to check. Heuristically, the conditions
imply that ... |
0904.2311 | Source Coding with a Side Information "Vending Machine" | cs.IT math.IT | We study source coding in the presence of side information, when the system
can take actions that affect the availability, quality, or nature of the side
information. We begin by extending the Wyner-Ziv problem of source coding with
decoder side information to the case where the decoder is allowed to choose
actions a... |
0904.2320 | Why Global Performance is a Poor Metric for Verifying Convergence of
Multi-agent Learning | cs.MA cs.LG | Experimental verification has been the method of choice for verifying the
stability of a multi-agent reinforcement learning (MARL) algorithm as the
number of agents grows and theoretical analysis becomes prohibitively complex.
For cooperative agents, where the ultimate goal is to optimize some global
metric, the stab... |
0904.2375 | The Zeta Function of a Periodic-Finite-Type Shift | cs.IT math.IT | The class of periodic-finite-type shifts (PFT's) is a class of sofic shifts
that strictly includes the class of shifts of finite type (SFT's), and the zeta
function of a PFT is a generating function for the number of periodic sequences
in the shift. In this paper, we derive a useful formula for the zeta function
of a... |
0904.2401 | A Combinatorial Study of Linear Deterministic Relay Networks | cs.IT math.IT | In the last few years the so--called "linear deterministic" model of relay
channels has gained popularity as a means of studying the flow of information
over wireless communication networks, and this approach generalizes the model
of wireline networks which is standard in network optimization. There is recent
work ex... |
0904.2441 | Reliable Identification of RFID Tags Using Multiple Independent Reader
Sessions | cs.IT math.IT | Radio Frequency Identification (RFID) systems are gaining momentum in various
applications of logistics, inventory, etc. A generic problem in such systems is
to ensure that the RFID readers can reliably read a set of RFID tags, such that
the probability of missing tags stays below an acceptable value. A tag may be
mi... |
0904.2448 | All that Glisters is not Galled | cs.DM cs.CE q-bio.PE | Galled trees, evolutionary networks with isolated reticulation cycles, have
appeared under several slightly different definitions in the literature. In
this paper we establish the actual relationships between the main four such
alternative definitions: namely, the original galled trees, level-1 networks,
nested netwo... |
0904.2477 | Joint Range of R\'enyi Entropies | cs.IT math.IT math.PR | The exact range of the joined values of several R\'{e}nyi entropies is
determined. The method is based on topology with special emphasis on the
orientation of the objects studied. Like in the case when only two orders of
R\'{e}nyi entropies are studied one can parametrize upper and lower bounds but
an explicit formul... |
0904.2482 | Good Concatenated Code Ensembles for the Binary Erasure Channel | cs.IT math.IT | In this work, we give good concatenated code ensembles for the binary erasure
channel (BEC). In particular, we consider repeat multiple-accumulate (RMA) code
ensembles formed by the serial concatenation of a repetition code with multiple
accumulators, and the hybrid concatenated code (HCC) ensembles recently
introduc... |
0904.2585 | Interference Relay Channels - Part I: Transmission Rates | cs.IT math.IT | We analyze the performance of a system composed of two interfering
point-to-point links where the transmitters can exploit a common relay to
improve their individual transmission rate. When the relay uses the
amplify-and-forward protocol we prove that it is not always optimal (in some
sense defined later on) to explo... |
0904.2587 | Interference Relay Channels - Part II: Power Allocation Games | cs.IT math.IT | In the first part of this paper we have derived achievable transmission rates
for the (single-band) interference relay channel (IRC) when the relay
implements either the amplify-and-forward, decode-and-forward or
estimate-and-forward protocol. Here, we consider wireless networks that can be
modeled by a multi-band IR... |
0904.2595 | A Methodology for Learning Players' Styles from Game Records | cs.AI cs.LG | We describe a preliminary investigation into learning a Chess player's style
from game records. The method is based on attempting to learn features of a
player's individual evaluation function using the method of temporal
differences, with the aid of a conventional Chess engine architecture. Some
encouraging results ... |
0904.2623 | Exponential Family Graph Matching and Ranking | cs.LG cs.AI | We present a method for learning max-weight matching predictors in bipartite
graphs. The method consists of performing maximum a posteriori estimation in
exponential families with sufficient statistics that encode permutations and
data features. Although inference is in general hard, we show that for one very
relevan... |
0904.2695 | Compressive Diffraction Tomography for Weakly Scattering | cs.CE cs.IT math.IT | An appealing requirement from the well-known diffraction tomography (DT)
exists for success reconstruction from few-view and limited-angle data.
Inspired by the well-known compressive sensing (CS), the accurate
super-resolution reconstruction from highly sparse data for the weakly scatters
has been investigated in th... |
0904.2827 | Principle of development | cs.AI | Today, science have a powerful tool for the description of reality - the
numbers. However, the concept of number was not immediately, lets try to trace
the evolution of the concept. The numbers emerged as the need for accurate
estimates of the amount in order to permit a comparison of some objects. So if
you see to i... |
0904.2861 | A simple algorithm for decoding both errors and erasures of Reed-Solomon
codes | cs.IT math.IT | A simple algorithm for decoding both errors and erasures of Reed-Solomon
codes is described.
|
0904.2863 | Error Scaling Laws for Linear Optimal Estimation from Relative
Measurements | cs.IT math.IT | We study the problem of estimating vector-valued variables from noisy
"relative" measurements. This problem arises in several sensor network
applications. The measurement model can be expressed in terms of a graph, whose
nodes correspond to the variables and edges to noisy measurements of the
difference between two v... |
0904.2921 | Inter-Session Network Coding with Strategic Users: A Game-Theoretic
Analysis of Network Coding | cs.IT math.IT | A common assumption in the existing network coding literature is that the
users are cooperative and non-selfish. However, this assumption can be violated
in practice. In this paper, we analyze inter-session network coding in a wired
network using game theory. We assume selfish users acting strategically to
maximize t... |
0904.2953 | Towards an Intelligent System for Risk Prevention and Management | cs.AI cs.MA | Making a decision in a changeable and dynamic environment is an arduous task
owing to the lack of information, their uncertainties and the unawareness of
planners about the future evolution of incidents. The use of a decision support
system is an efficient solution of this issue. Such a system can help emergency
plan... |
0904.2954 | Agent-Based Decision Support System to Prevent and Manage Risk
Situations | cs.AI cs.MA | The topic of risk prevention and emergency response has become a key social
and political concern. One approach to address this challenge is to develop
Decision Support Systems (DSS) that can help emergency planners and responders
to detect emergencies, as well as to suggest possible course of actions to deal
with th... |
0904.3060 | An efficient quantum search engine on unsorted database | cs.DB cs.DS | We consider the problem of finding one or more desired items out of an
unsorted database. Patel has shown that if the database permits quantum
queries, then mere digitization is sufficient for efficient search for one
desired item. The algorithm, called factorized quantum search algorithm,
presented by him can locate... |
0904.3063 | Using Dissortative Mating Genetic Algorithms to Track the Extrema of
Dynamic Deceptive Functions | cs.NE | Traditional Genetic Algorithms (GAs) mating schemes select individuals for
crossover independently of their genotypic or phenotypic similarities. In
Nature, this behaviour is known as random mating. However, non-random schemes -
in which individuals mate according to their kinship or likeness - are more
common in nat... |
0904.3148 | CRT-Based High Speed Parallel Architecture for Long BCH Encoding | cs.AR cs.IT math.IT | BCH (Bose-Chaudhuri-Hocquenghen) error correcting codes ([1]-[2]) are now
widely used in communication systems and digital technology. Direct LFSR(linear
feedback shifted register)-based encoding of a long BCH code suffers from
serial-in and serial-out limitation and large fanout effect of some XOR gates.
This makes ... |
0904.3151 | Efficient Construction of Neighborhood Graphs by the Multiple Sorting
Method | cs.DS cs.LG | Neighborhood graphs are gaining popularity as a concise data representation
in machine learning. However, naive graph construction by pairwise distance
calculation takes $O(n^2)$ runtime for $n$ data points and this is
prohibitively slow for millions of data points. For strings of equal length,
the multiple sorting m... |
0904.3165 | Fading Broadcast Channels with State Information at the Receivers | cs.IT math.IT | Despite considerable progress on the information-theoretic broadcast channel,
the capacity region of fading broadcast channels with channel state known at
the receivers but unknown at the transmitter remains unresolved. We address
this subject by introducing a layered erasure broadcast channel model in which
each com... |
0904.3310 | FastLMFI: An Efficient Approach for Local Maximal Patterns Propagation
and Maximal Patterns Superset Checking | cs.DB cs.AI cs.DS | Maximal frequent patterns superset checking plays an important role in the
efficient mining of complete Maximal Frequent Itemsets (MFI) and maximal search
space pruning. In this paper we present a new indexing approach, FastLMFI for
local maximal frequent patterns (itemset) propagation and maximal patterns
superset c... |
0904.3312 | HybridMiner: Mining Maximal Frequent Itemsets Using Hybrid Database
Representation Approach | cs.DB cs.AI cs.DS | In this paper we present a novel hybrid (arraybased layout and vertical
bitmap layout) database representation approach for mining complete Maximal
Frequent Itemset (MFI) on sparse and large datasets. Our work is novel in terms
of scalability, item search order and two horizontal and vertical projection
techniques. W... |
0904.3316 | Ramp: Fast Frequent Itemset Mining with Efficient Bit-Vector Projection
Technique | cs.DB cs.AI cs.DS | Mining frequent itemset using bit-vector representation approach is very
efficient for dense type datasets, but highly inefficient for sparse datasets
due to lack of any efficient bit-vector projection technique. In this paper we
present a novel efficient bit-vector projection technique, for sparse and dense
datasets... |
0904.3319 | Fast Algorithms for Mining Interesting Frequent Itemsets without Minimum
Support | cs.DB cs.AI cs.DS | Real world datasets are sparse, dirty and contain hundreds of items. In such
situations, discovering interesting rules (results) using traditional frequent
itemset mining approach by specifying a user defined input support threshold is
not appropriate. Since without any domain knowledge, setting support threshold
sma... |
0904.3320 | Using Association Rules for Better Treatment of Missing Values | cs.DB cs.AI cs.DS | The quality of training data for knowledge discovery in databases (KDD) and
data mining depends upon many factors, but handling missing values is
considered to be a crucial factor in overall data quality. Today real world
datasets contains missing values due to human, operational error, hardware
malfunctioning and ma... |
0904.3321 | Introducing Partial Matching Approach in Association Rules for Better
Treatment of Missing Values | cs.DB cs.AI cs.DS | Handling missing values in training datasets for constructing learning models
or extracting useful information is considered to be an important research task
in data mining and knowledge discovery in databases. In recent years, lot of
techniques are proposed for imputing missing values by considering attribute
relati... |
0904.3340 | Lossy Compression in Near-Linear Time via Efficient Random Codebooks and
Databases | cs.IT math.IT | The compression-complexity trade-off of lossy compression algorithms that are
based on a random codebook or a random database is examined. Motivated, in
part, by recent results of Gupta-Verd\'{u}-Weissman (GVW) and their underlying
connections with the pattern-matching scheme of Kontoyiannis' lossy Lempel-Ziv
algorit... |
0904.3351 | A Subsequence-Histogram Method for Generic Vocabulary Recognition over
Deletion Channels | cs.IT cs.DS math.IT stat.AP | We consider the problem of recognizing a vocabulary--a collection of words
(sequences) over a finite alphabet--from a potential subsequence of one of its
words. We assume the given subsequence is received through a deletion channel
as a result of transmission of a random word from one of the two generic
underlying vo... |
0904.3352 | Optimistic Initialization and Greediness Lead to Polynomial Time
Learning in Factored MDPs - Extended Version | cs.AI cs.LG | In this paper we propose an algorithm for polynomial-time reinforcement
learning in factored Markov decision processes (FMDPs). The factored optimistic
initial model (FOIM) algorithm, maintains an empirical model of the FMDP in a
conventional way, and always follows a greedy policy with respect to its model.
The only... |
0904.3356 | A method for Hedging in continuous time | cs.IT cs.AI math.IT math.PR | We present a method for hedging in continuous time.
|
0904.3444 | Comment to "Coverage by Randomly Deployed Wireless Sensor Networks" | cs.IT math.IT | It is a correction paper on "P.J. Wan and C.W. Yi, "Coverage by Randomly
Deployed Wireless Sensor Networks", IEEE Transaction On Information Theory,
vol.52, No.6, June 2006."
In the above paper, Lemma (4), on page 2659 play the key role for deriving
the main results in the paper. The statement as well as the proof ... |
0904.3469 | Toggling operators in computability logic | cs.LO cs.AI math.LO | Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html ) is a
research program for redeveloping logic as a formal theory of computability, as
opposed to the formal theory of truth which it has more traditionally been.
Formulas in CL stand for interactive computational problems, seen as games
between a... |
0904.3501 | Incentive Compatible Budget Elicitation in Multi-unit Auctions | cs.GT cs.MA | In this paper, we consider the problem of designing incentive compatible
auctions for multiple (homogeneous) units of a good, when bidders have private
valuations and private budget constraints. When only the valuations are private
and the budgets are public, Dobzinski {\em et al} show that the {\em adaptive
clinchin... |
0904.3612 | Variations of the Turing Test in the Age of Internet and Virtual Reality | cs.AI cs.HC | Inspired by Hofstadter's Coffee-House Conversation (1982) and by the science
fiction short story SAM by Schattschneider (1988), we propose and discuss
criteria for non-mechanical intelligence. Firstly, we emphasize the practical
need for such tests in view of massively multiuser online role-playing games
(MMORPGs) an... |
0904.3642 | Direction-of-Arrival Estimation for Temporally Correlated Narrowband
Signals | cs.IT math.IT | signal direction-of-arrival estimation using an array of sensors has been the
subject of intensive research and development during the last two decades.
Efforts have been directed to both, better solutions for the general data model
and to develop more realistic models. So far, many authors have assumed the
data to b... |
0904.3650 | The use of invariant moments in hand-written character recognition | cs.NE | The goal of this paper is to present the implementation of a Radial Basis
Function neural network with built-in knowledge to recognize hand-written
characters. The neural network includes in its architecture gates controlled by
an attraction/repulsion system of coefficients. These coefficients are derived
from a prep... |
0904.3664 | Introduction to Machine Learning: Class Notes 67577 | cs.LG | Introduction to Machine learning covering Statistical Inference (Bayes, EM,
ML/MaxEnt duality), algebraic and spectral methods (PCA, LDA, CCA, Clustering),
and PAC learning (the Formal model, VC dimension, Double Sampling theorem).
|
0904.3667 | Considerations upon the Machine Learning Technologies | cs.LG cs.AI | Artificial intelligence offers superior techniques and methods by which
problems from diverse domains may find an optimal solution. The Machine
Learning technologies refer to the domain of artificial intelligence aiming to
develop the techniques allowing the computers to "learn". Some systems based on
Machine Learnin... |
0904.3669 | Collaborative systems and multiagent systems | cs.MA | This paper presents some basic elements regarding the domain of the
collaborative systems, a domain of maximum actuality and also the multiagent
systems, developed as a result of a sound study on the one-agent systems.
|
0904.3701 | Semantic Social Network Analysis | cs.AI | Social Network Analysis (SNA) tries to understand and exploit the key
features of social networks in order to manage their life cycle and predict
their evolution. Increasingly popular web 2.0 sites are forming huge social
network. Classical methods from social network analysis (SNA) have been applied
to such online n... |
0904.3778 | Word-Valued Sources: an Ergodic Theorem, an AEP and the Conservation of
Entropy | cs.IT math.IT | A word-valued source $\mathbf{Y} = Y_1,Y_2,...$ is discrete random process
that is formed by sequentially encoding the symbols of a random process
$\mathbf{X} = X_1,X_2,...$ with codewords from a codebook $\mathscr{C}$. These
processes appear frequently in information theory (in particular, in the
analysis of source-... |
0904.3780 | Noisy Signal Recovery via Iterative Reweighted L1-Minimization | math.NA cs.IT math.IT | Compressed sensing has shown that it is possible to reconstruct sparse high
dimensional signals from few linear measurements. In many cases, the solution
can be obtained by solving an L1-minimization problem, and this method is
accurate even in the presence of noise. Recent a modified version of this
method, reweight... |
0904.3808 | Automated Epilepsy Diagnosis Using Interictal Scalp EEG | cs.AI cs.CV | Approximately over 50 million people worldwide suffer from epilepsy.
Traditional diagnosis of epilepsy relies on tedious visual screening by highly
trained clinicians from lengthy EEG recording that contains the presence of
seizure (ictal) activities. Nowadays, there are many automatic systems that can
recognize seiz... |
0904.3894 | On Capacity Computation for the Two-User Binary Multiple-Access Channel | cs.IT math.IT | This paper deals with the problem of computing the boundary of the capacity
region for the memoryless two-user binary-input binary-output multiple-access
channel ((2,2;2)-MAC), or equivalently, the computation of input probability
distributions maximizing weighted sum-rate. This is equivalent to solving a
difficult n... |
0904.3944 | Better Global Polynomial Approximation for Image Rectification | cs.CV cs.RO | When using images to locate objects, there is the problem of correcting for
distortion and misalignment in the images. An elegant way of solving this
problem is to generate an error correcting function that maps points in an
image to their corrected locations. We generate such a function by fitting a
polynomial to a ... |
0904.3953 | Guarded resolution for answer set programming | cs.AI | We describe a variant of resolution rule of proof and show that it is
complete for stable semantics of logic programs. We show applications of this
result.
|
0904.4006 | Joint Source-Channel Coding on a Multiple Access Channel with Side
Information | cs.IT math.IT | We consider the problem of transmission of several distributed correlated
sources over a multiple access channel (MAC) with side information at the
sources and the decoder. Source-channel separation does not hold for this
channel. Sufficient conditions are provided for transmission of sources with a
given distortion.... |
0904.4041 | Content-Based Sub-Image Retrieval with Relevance Feedback | cs.DB cs.IR | The typical content-based image retrieval problem is to find images within a
database that are similar to a given query image. This paper presents a
solution to a different problem, namely that of content based sub-image
retrieval, i.e., finding images from a database that contains another image.
Note that this is di... |
0904.4057 | Decentralized Coding Algorithms for Distributed Storage in Wireless
Sensor Networks | cs.IT cs.DS cs.NI math.IT | We consider large-scale wireless sensor networks with $n$ nodes, out of which
k are in possession, (e.g., have sensed or collected in some other way) k
information packets. In the scenarios in which network nodes are vulnerable
because of, for example, limited energy or a hostile environment, it is
desirable to disse... |
0904.4094 | On the Upper Bounds of MDS Codes | math.CO cs.IT math.IT | Let $M_{q}(k)$ be the maximum length of MDS codes with parameters $q,k$. In
this paper, the properties of $M_{q}(k)$ are studied, and some new upper bounds
of $M_{q}(k)$ are obtained. Especially we obtain that $M_{q}(q-1)\leq
q+2(q\equiv4(mod 6)), M_{q}(q-2)\leq q+1(q\equiv4(mod 6)), M_{q}(k)\leq q+k-3
(q=36(5s+1), s... |
0904.4174 | Denial of service attack in the Internet: agent-based intrusion
detection and reaction | cs.NI cs.MA | This paper deals with denial of service attack. Overview of the existing
attacks and methods is proposed. Classification scheme is presented for a
different denial of service attacks. There is considered agent-based intrusion
detection systems architecture. Considered main components and working
principles for a syst... |
0904.4283 | Opportunistic Spatial Orthogonalization and Its Application in Fading
Cognitive Radio Networks | cs.IT math.IT | Opportunistic Spatial Orthogonalization (OSO) is a cognitive radio scheme
that allows the existence of secondary users and hence increases the system
throughput, even if the primary user occupies all the frequency bands all the
time. Notably, this throughput advantage is obtained without sacrificing the
performance o... |
0904.4343 | On the Achievability of Interference Alignment in the K-User Constant
MIMO Interference Channel | cs.IT math.IT | Interference alignment in the K-user MIMO interference channel with constant
channel coefficients is considered. A novel constructive method for finding the
interference alignment solution is proposed for the case where the number of
transmit antennas equals the number of receive antennas (NT = NR = N), the
number of... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.