id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1008.4957 | Remarkable evolutionary laws of absolute and relative entropies with
dynamical systems | nlin.CD cs.IT math.IT physics.ao-ph physics.flu-dyn | The evolution of entropy is derived with respect to dynamical systems. For a
stochastic system, its relative entropy $D$ evolves in accordance with the
second law of thermodynamics; its absolute entropy $H$ may also be so, provided
that the stochastic perturbation is additive and the flow of the vector field
is nondi... |
1008.4973 | Entropy-Based Search Algorithm for Experimental Design | stat.ML cs.LG physics.comp-ph physics.data-an | The scientific method relies on the iterated processes of inference and
inquiry. The inference phase consists of selecting the most probable models
based on the available data; whereas the inquiry phase consists of using what
is known about the models to select the most relevant experiment. Optimizing
inquiry involve... |
1008.4990 | Multi-Agent Deployment for Visibility Coverage in Polygonal Environments
with Holes | cs.RO cs.DC cs.MA | This article presents a distributed algorithm for a group of robotic agents
with omnidirectional vision to deploy into nonconvex polygonal environments
with holes. Agents begin deployment from a common point, possess no prior
knowledge of the environment, and operate only under line-of-sight sensing and
communication... |
1008.5057 | Approximate Top-k Retrieval from Hidden Relations | cs.DB cs.IR | We consider the evaluation of approximate top-k queries from relations with
a-priori unknown values. Such relations can arise for example in the context of
expensive predicates, or cloud-based data sources. The task is to find an
approximate top-k set that is close to the exact one while keeping the total
processing ... |
1008.5073 | On the Count of Trees | cs.DB | Regular tree grammars and regular path expressions constitute core constructs
widely used in programming languages and type systems. Nevertheless, there has
been little research so far on frameworks for reasoning about path expressions
where node cardinality constraints occur along a path in a tree. We present a
logi... |
1008.5078 | Prediction by Compression | cs.IT cs.AI cs.LG math.IT | It is well known that text compression can be achieved by predicting the next
symbol in the stream of text data based on the history seen up to the current
symbol. The better the prediction the more skewed the conditional probability
distribution of the next symbol and the shorter the codeword that needs to be
assign... |
1008.5090 | Fixed-point and coordinate descent algorithms for regularized kernel
methods | cs.LG math.OC stat.CO stat.ML | In this paper, we study two general classes of optimization algorithms for
kernel methods with convex loss function and quadratic norm regularization, and
analyze their convergence. The first approach, based on fixed-point iterations,
is simple to implement and analyze, and can be easily parallelized. The second,
bas... |
1008.5105 | Indexability, concentration, and VC theory | cs.DS cs.LG | Degrading performance of indexing schemes for exact similarity search in high
dimensions has long since been linked to histograms of distributions of
distances and other 1-Lipschitz functions getting concentrated. We discuss this
observation in the framework of the phenomenon of concentration of measure on
the struct... |
1008.5133 | Memristor Crossbar-based Hardware Implementation of IDS Method | cs.LG cs.AI cs.AR | Ink Drop Spread (IDS) is the engine of Active Learning Method (ALM), which is
the methodology of soft computing. IDS, as a pattern-based processing unit,
extracts useful information from a system subjected to modeling. In spite of
its excellent potential in solving problems such as classification and modeling
compare... |
1008.5161 | Artificial Brain Based on Credible Neural Circuits in a Human Brain | cs.AI q-bio.NC | Neurons are individually translated into simple gates to plan a brain based
on human psychology and intelligence. State machines, assumed previously
learned in subconscious associative memory are shown to enable equation solving
and rudimentary thinking using nanoprocessing within short term memory.
|
1008.5163 | Learning Multi-modal Similarity | cs.AI | In many applications involving multi-media data, the definition of similarity
between items is integral to several key tasks, e.g., nearest-neighbor
retrieval, classification, and recommendation. Data in such regimes typically
exhibits multiple modalities, such as acoustic and visual content of video.
Integrating suc... |
1008.5166 | Network Archaeology: Uncovering Ancient Networks from Present-day
Interactions | q-bio.MN cs.SI | Often questions arise about old or extinct networks. What proteins interacted
in a long-extinct ancestor species of yeast? Who were the central players in
the Last.fm social network 3 years ago? Our ability to answer such questions
has been limited by the unavailability of past versions of networks. To
overcome these... |
1008.5188 | Totally Corrective Boosting for Regularized Risk Minimization | cs.AI | Consideration of the primal and dual problems together leads to important new
insights into the characteristics of boosting algorithms. In this work, we
propose a general framework that can be used to design new boosting algorithms.
A wide variety of machine learning problems essentially minimize a regularized
risk f... |
1008.5189 | Improving the Performance of maxRPC | cs.AI | Max Restricted Path Consistency (maxRPC) is a local consistency for binary
constraints that can achieve considerably stronger pruning than arc
consistency. However, existing maxRRC algorithms suffer from overheads and
redundancies as they can repeatedly perform many constraint checks without
triggering any value dele... |
1008.5196 | The Degrees of Freedom of MIMO Interference Channels without State
Information at Transmitters | cs.IT math.IT | This paper fully determines the degree-of-freedom (DoF) region of two-user
interference channels with arbitrary number of transmit and receive antennas
and isotropic fading, where the channel state information is available to the
receivers but not to the transmitters. The result characterizes the capacity
region to t... |
1008.5204 | A Smoothing Stochastic Gradient Method for Composite Optimization | math.OC cs.LG | We consider the unconstrained optimization problem whose objective function
is composed of a smooth and a non-smooth conponents where the smooth component
is the expectation a random function. This type of problem arises in some
interesting applications in machine learning. We propose a stochastic gradient
descent al... |
1008.5209 | Network Flow Algorithms for Structured Sparsity | cs.LG stat.ML | We consider a class of learning problems that involve a structured
sparsity-inducing norm defined as the sum of $\ell_\infty$-norms over groups of
variables. Whereas a lot of effort has been put in developing fast optimization
methods when the groups are disjoint or embedded in a specific hierarchical
structure, we a... |
1008.5231 | The adaptive projected subgradient method constrained by families of
quasi-nonexpansive mappings and its application to online learning | math.OC cs.IT cs.LG math.IT | Many online, i.e., time-adaptive, inverse problems in signal processing and
machine learning fall under the wide umbrella of the asymptotic minimization of
a sequence of non-negative, convex, and continuous functions. To incorporate
a-priori knowledge into the design, the asymptotic minimization task is usually
const... |
1008.5254 | Sparse Channel Estimation for Amplify-and-Forward Two-way Relay Network
with Compressed Sensing | cs.IT math.IT | Amplify-and-forward two-way relay network (AFTWRN) was introduced to realize
high-data rate transmission over the wireless frequency-selective channel.
However, AFTWRC requires the knowledge of channel state information (CSI) not
only for coherent data detection but also for the selfdata removal. This is
partial acco... |
1008.5274 | Statistical mechanical assessment of a reconstruction limit of
compressed sensing: Toward theoretical analysis of correlated signals | cs.IT cond-mat.dis-nn math.IT | We provide a scheme for exploring the reconstruction limit of compressed
sensing by minimizing the general cost function under the random measurement
constraints for generic correlated signal sources. Our scheme is based on the
statistical mechanical replica method for dealing with random systems. As a
simple but non... |
1008.5287 | Lexical Co-occurrence, Statistical Significance, and Word Association | cs.CL cs.IR | Lexical co-occurrence is an important cue for detecting word associations. We
present a theoretical framework for discovering statistically significant
lexical co-occurrences from a given corpus. In contrast with the prevalent
practice of giving weightage to unigram frequencies, we focus only on the
documents contain... |
1008.5288 | Relative entropy as a measure of inhomogeneity in general relativity | gr-qc cs.IT hep-th math-ph math.IT math.MP | We introduce the notion of relative volume entropy for two spacetimes with
preferred compact spacelike foliations. This is accomplished by applying the
notion of Kullback-Leibler divergence to the volume elements induced on
spacelike slices. The resulting quantity gives a lower bound on the number of
bits which are n... |
1008.5325 | Inference with Multivariate Heavy-Tails in Linear Models | cs.LG cs.IT math.IT | Heavy-tailed distributions naturally occur in many real life problems.
Unfortunately, it is typically not possible to compute inference in closed-form
in graphical models which involve such heavy-tailed distributions.
In this work, we propose a novel simple linear graphical model for
independent latent random varia... |
1008.5357 | Preference Elicitation in Prioritized Skyline Queries | cs.DB | Preference queries incorporate the notion of binary preference relation into
relational database querying. Instead of returning all the answers, such
queries return only the best answers, according to a given preference relation.
Preference queries are a fast growing area of database research. Skyline
queries constit... |
1008.5372 | Penalty Decomposition Methods for $L0$-Norm Minimization | math.OC cs.CV cs.IT cs.LG cs.NA math.IT stat.ME | In this paper we consider general l0-norm minimization problems, that is, the
problems with l0-norm appearing in either objective function or constraint. In
particular, we first reformulate the l0-norm constrained problem as an
equivalent rank minimization problem and then apply the penalty decomposition
(PD) method ... |
1008.5373 | Penalty Decomposition Methods for Rank Minimization | math.OC cs.LG cs.NA cs.SY q-fin.CP q-fin.ST | In this paper we consider general rank minimization problems with rank
appearing in either objective function or constraint. We first establish that a
class of special rank minimization problems has closed-form solutions. Using
this result, we then propose penalty decomposition methods for general rank
minimization p... |
1008.5380 | Quantum Tagging for Tags Containing Secret Classical Data | quant-ph cs.CR cs.IT math.IT | Various authors have considered schemes for {\it quantum tagging}, that is,
authenticating the classical location of a classical tagging device by sending
and receiving quantum signals from suitably located distant sites, in an
environment controlled by an adversary whose quantum information processing and
transmitti... |
1008.5386 | Mixed Cumulative Distribution Networks | stat.ML cs.LG | Directed acyclic graphs (DAGs) are a popular framework to express
multivariate probability distributions. Acyclic directed mixed graphs (ADMGs)
are generalizations of DAGs that can succinctly capture much richer sets of
conditional independencies, and are especially useful in modeling the effects
of latent variables ... |
1008.5387 | Pattern Recognition in Collective Cognitive Systems: Hybrid
Human-Machine Learning (HHML) By Heterogeneous Ensembles | cs.AI astro-ph.CO q-bio.QM | The ubiquitous role of the cyber-infrastructures, such as the WWW, provides
myriad opportunities for machine learning and its broad spectrum of application
domains taking advantage of digital communication. Pattern classification and
feature extraction are among the first applications of machine learning that
have re... |
1008.5390 | Applications of Machine Learning Methods to Quantifying Phenotypic
Traits that Distinguish the Wild Type from the Mutant Arabidopsis Thaliana
Seedlings during Root Gravitropism | q-bio.QM cs.CE cs.LG q-bio.GN | Post-genomic research deals with challenging problems in screening genomes of
organisms for particular functions or potential for being the targets of
genetic engineering for desirable biological features. 'Phenotyping' of wild
type and mutants is a time-consuming and costly effort by many individuals.
This article i... |
1008.5393 | Increased Capacity per Unit-Cost by Oversampling | cs.IT math.IT | It is demonstrated that doubling the sampling rate recovers some of the loss
in capacity incurred on the bandlimited Gaussian channel with a one-bit output
quantizer.
|
1009.0050 | Golden Coded Multiple Beamforming | cs.IT math.IT | The Golden Code is a full-rate full-diversity space-time code, which achieves
maximum coding gain for Multiple-Input Multiple-Output (MIMO) systems with two
transmit and two receive antennas. Since four information symbols taken from an
M-QAM constellation are selected to construct one Golden Code codeword, a
maximum... |
1009.0051 | Variational Iteration Method for Image Restoration | math.NA cs.CV | The famous Perona-Malik (P-M) equation which was at first introduced for
image restoration has been solved via various numerical methods. In this paper
we will solve it for the first time via applying a new numerical method called
the Variational Iteration Method (VIM) and the correspondent approximated
solutions wil... |
1009.0068 | Joint Uplink and Downlink Relay Selection in Cooperative Cellular
Networks | cs.IT math.IT | We consider relay selection technique in a cooperative cellular network where
user terminals act as mobile relays to help the communications between base
station (BS) and mobile station (MS). A novel relay selection scheme, called
Joint Uplink and Downlink Relay Selection (JUDRS), is proposed in this paper.
Specifica... |
1009.0072 | Joint Relay Selection and Link Adaptation for Distributed Beamforming in
Regenerative Cooperative Networks | cs.IT math.IT | Relay selection enhances the performance of the cooperative networks by
selecting the links with higher capacity. Meanwhile link adaptation improves
the spectral efficiency of wireless data-centric networks through adapting the
modulation and coding schemes (MCS) to the current link condition. In this
paper, relay se... |
1009.0074 | Energy-Efficient Transmission Schemes in Cooperative Cellular Systems | cs.IT math.IT | Energy-efficient communication is an important requirement for mobile
devices, as the battery technology has not kept up with the growing
requirements stemming from ubiquitous multimedia applications. This paper
considers energy-efficient transmission schemes in cooperative cellular systems
with unbalanced traffic be... |
1009.0077 | Not only a lack of right definitions: Arguments for a shift in
information-processing paradigm | cs.AI q-bio.NC | Machine Consciousness and Machine Intelligence are not simply new buzzwords
that occupy our imagination. Over the last decades, we witness an unprecedented
rise in attempts to create machines with human-like features and capabilities.
However, despite widespread sympathy and abundant funding, progress in these
enterp... |
1009.0078 | Energy-Efficient Relay Selection and Optimal Relay Location in
Cooperative Cellular Networks with Asymmetric Traffic | cs.IT math.IT | Energy-efficient communication is an important requirement for mobile relay
networks due to the limited battery power of user terminals. This paper
considers energy-efficient relaying schemes through selection of mobile relays
in cooperative cellular systems with asymmetric traffic. The total energy
consumption per i... |
1009.0108 | Emotional State Categorization from Speech: Machine vs. Human | cs.CL cs.AI cs.HC | This paper presents our investigations on emotional state categorization from
speech signals with a psychologically inspired computational model against
human performance under the same experimental setup. Based on psychological
studies, we propose a multistage categorization strategy which allows
establishing an aut... |
1009.0117 | Exploring Language-Independent Emotional Acoustic Features via Feature
Selection | cs.LG | We propose a novel feature selection strategy to discover
language-independent acoustic features that tend to be responsible for emotions
regardless of languages, linguistics and other factors. Experimental results
suggest that the language-independent feature subset discovered yields the
performance comparable to th... |
1009.0119 | Precursors and Laggards: An Analysis of Semantic Temporal Relationships
on a Blog Network | cs.SI physics.soc-ph | We explore the hypothesis that it is possible to obtain information about the
dynamics of a blog network by analysing the temporal relationships between
blogs at a semantic level, and that this type of analysis adds to the knowledge
that can be extracted by studying the network only at the structural level of
URL lin... |
1009.0240 | Modeling Dynamical Influence in Human Interaction Patterns | cs.SI physics.soc-ph | How can we model influence between individuals in a social system, even when
the network of interactions is unknown? In this article, we review the
literature on the "influence model," which utilizes independent time series to
estimate how much the state of one actor affects the state of another actor in
the system. ... |
1009.0255 | The Conceptual Integration Modeling Framework: Abstracting from the
Multidimensional Model | cs.DB | Data warehouses are overwhelmingly built through a bottom-up process, which
starts with the identification of sources, continues with the extraction and
transformation of data from these sources, and then loads the data into a set
of data marts according to desired multidimensional relational schemas. End
user busine... |
1009.0267 | Sustaining the Internet with Hyperbolic Mapping | cs.NI cond-mat.dis-nn cond-mat.stat-mech cs.SI physics.soc-ph | The Internet infrastructure is severely stressed. Rapidly growing overheads
associated with the primary function of the Internet---routing information
packets between any two computers in the world---cause concerns among Internet
experts that the existing Internet routing architecture may not sustain even
another dec... |
1009.0282 | Empirical processes, typical sequences and coordinated actions in
standard Borel spaces | cs.IT math.IT | This paper proposes a new notion of typical sequences on a wide class of
abstract alphabets (so-called standard Borel spaces), which is based on
approximations of memoryless sources by empirical distributions uniformly over
a class of measurable "test functions." In the finite-alphabet case, we can
take all uniformly... |
1009.0289 | Direct spreading measures of Laguerre polynomials | math-ph cs.IT math.IT math.MP quant-ph | The direct spreading measures of the Laguerre polynomials, which quantify the
distribution of its Rakhmanov probability density along the positive real line
in various complementary and qualitatively different ways, are investigated.
These measures include the familiar root-mean-square or standard deviation and
the i... |
1009.0304 | Joint Source-Channel Coding with Correlated Interference | cs.IT math.IT | We study the joint source-channel coding problem of transmitting a
discrete-time analog source over an additive white Gaussian noise (AWGN)
channel with interference known at transmitter.We consider the case when the
source and the interference are correlated. We first derive an outer bound on
the achievable distorti... |
1009.0306 | Fast Overlapping Group Lasso | cs.LG | The group Lasso is an extension of the Lasso for feature selection on
(predefined) non-overlapping groups of features. The non-overlapping group
structure limits its applicability in practice. There have been several recent
attempts to study a more general formulation, where groups of features are
given, potentially ... |
1009.0347 | Solving the Resource Constrained Project Scheduling Problem with
Generalized Precedences by Lazy Clause Generation | cs.AI | The technical report presents a generic exact solution approach for
minimizing the project duration of the resource-constrained project scheduling
problem with generalized precedences (Rcpsp/max). The approach uses lazy clause
generation, i.e., a hybrid of finite domain and Boolean satisfiability solving,
in order to... |
1009.0368 | Discovering potential user browsing behaviors using custom-built apriori
algorithm | cs.DB | Most of the organizations put information on the web because they want it to
be seen by the world. Their goal is to have visitors come to the site, feel
comfortable and stay a while and try to know completely about the running
organization. As educational system increasingly requires data mining, the
opportunity aris... |
1009.0373 | The concept of an order and its application for research of the
deterministic chains of symbols | cs.IT math.IT physics.bio-ph | The present work is dedicated to searching parameters, alternative to
entropy, applicable for description of highly organized systems. The general
concept has been offered, in which the system complexity and order are
functions of the order establishment rules. The concept of order poles has been
introduced. The conc... |
1009.0384 | Clustering high dimensional data using subspace and projected clustering
algorithms | cs.DB | Problem statement: Clustering has a number of techniques that have been
developed in statistics, pattern recognition, data mining, and other fields.
Subspace clustering enumerates clusters of objects in all subspaces of a
dataset. It tends to produce many over lapping clusters. Approach: Subspace
clustering and proje... |
1009.0396 | A* Orthogonal Matching Pursuit: Best-First Search for Compressed Sensing
Signal Recovery | cs.IT math.IT | Compressed sensing is a developing field aiming at reconstruction of sparse
signals acquired in reduced dimensions, which make the recovery process
under-determined. The required solution is the one with minimum $\ell_0$ norm
due to sparsity, however it is not practical to solve the $\ell_0$ minimization
problem. Com... |
1009.0397 | Mobile Information Collectors' Trajectory Data Warehouse Design | cs.DB | To analyze complex phenomena which involve moving objects, Trajectory Data
Warehouse (TDW) seems to be an answer for many recent decision problems related
to various professions (physicians, commercial representatives, transporters,
ecologists ...) concerned with mobility. This work aims to make trajectories as
a fir... |
1009.0402 | An Applied Study on Educational Use of Facebook as a Web 2.0 Tool: The
Sample Lesson of Computer Networks and Communication | cs.SI | The main aim of the research was to examine educational use of Facebook. The
Computer Networks and Communication lesson was taken as the sample and the
attitudes of the students included in the study group towards Facebook were
measured in a semi-experimental setup. The students on Facebook platform were
examined for... |
1009.0407 | Experimental Evaluation of Branching Schemes for the CSP | cs.AI | The search strategy of a CP solver is determined by the variable and value
ordering heuristics it employs and by the branching scheme it follows. Although
the effects of variable and value ordering heuristics on search effort have
been widely studied, the effects of different branching schemes have received
less atte... |
1009.0425 | Optimization Framework and Graph-Based Approach for Relay-Assisted
Bidirectional OFDMA Cellular Networks | cs.IT cs.NI math.IT | This paper considers a relay-assisted bidirectional cellular network where
the base station (BS) communicates with each mobile station (MS) using OFDMA
for both uplink and downlink. The goal is to improve the overall system
performance by exploring the full potential of the network in various
dimensions including use... |
1009.0433 | Automatic Recommendation for Online Users Using Web Usage Mining | cs.IR cs.HC | A real world challenging task of the web master of an organization is to
match the needs of user and keep their attention in their web site. So, only
option is to capture the intuition of the user and provide them with the
recommendation list. Most specifically, an online navigation behavior grows
with each passing d... |
1009.0451 | The Challenge of Believability in Video Games: Definitions, Agents
Models and Imitation Learning | cs.AI | In this paper, we address the problem of creating believable agents (virtual
characters) in video games. We consider only one meaning of believability,
``giving the feeling of being controlled by a player'', and outline the problem
of its evaluation. We present several models for agents in games which can
produce bel... |
1009.0471 | Complexity and Stochastic Synchronization in Coupled Map Lattices and
Cellular Automata | nlin.CD cs.IT math.IT physics.comp-ph | Nowadays the question `what is complexity?' is a challenge to be answered.
This question is triggering a great quantity of works in the frontier of
physics, biology, mathematics and computer science. Even more when this century
has been told to be the century of Complexity. Although there seems to be no
urgency to an... |
1009.0498 | One side invertibility for implicit hyperbolic systems with delays | math.OC cs.SY | This paper deals with left invertibility problem of implicit hyperbolic
systems with delays in infinite dimensional Hilbert spaces. From a
decomposition procedure, invertibility for this class of systems is shown to be
equivalent to the left invertibility of a subsystem without delays.
|
1009.0499 | A PAC-Bayesian Analysis of Graph Clustering and Pairwise Clustering | cs.LG cs.DS stat.ML | We formulate weighted graph clustering as a prediction problem: given a
subset of edge weights we analyze the ability of graph clustering to predict
the remaining edge weights. This formulation enables practical and theoretical
comparison of different approaches to graph clustering as well as comparison of
graph clus... |
1009.0501 | Automatable Evaluation Method Oriented toward Behaviour Believability
for Video Games | cs.AI | Classic evaluation methods of believable agents are time-consuming because
they involve many human to judge agents. They are well suited to validate work
on new believable behaviours models. However, during the implementation,
numerous experiments can help to improve agents' believability. We propose a
method which a... |
1009.0516 | A Tractable Approach to Coverage and Rate in Cellular Networks | cs.IT cs.NI math.IT math.PR | Cellular networks are usually modeled by placing the base stations on a grid,
with mobile users either randomly scattered or placed deterministically. These
models have been used extensively but suffer from being both highly idealized
and not very tractable, so complex system-level simulations are used to
evaluate co... |
1009.0550 | Optimizing Selective Search in Chess | cs.AI cs.NE | In this paper we introduce a novel method for automatically tuning the search
parameters of a chess program using genetic algorithms. Our results show that a
large set of parameter values can be learned automatically, such that the
resulting performance is comparable with that of manually tuned parameters of
top tour... |
1009.0558 | Sliding Mode Control of Two-Level Quantum Systems | quant-ph cs.SY math.OC | This paper proposes a robust control method based on sliding mode design for
two-level quantum systems with bounded uncertainties. An eigenstate of the
two-level quantum system is identified as a sliding mode. The objective is to
design a control law to steer the system's state into the sliding mode domain
and then m... |
1009.0571 | Information-theoretic lower bounds on the oracle complexity of
stochastic convex optimization | stat.ML cs.SY math.OC | Relative to the large literature on upper bounds on complexity of convex
optimization, lesser attention has been paid to the fundamental hardness of
these problems. Given the extensive use of convex optimization in machine
learning and statistics, gaining an understanding of these complexity-theoretic
issues is impor... |
1009.0572 | Encoded packet-Assisted Rescue Approach to Reliable Unicast in Wireless
Networks | cs.IT cs.NI math.IT | Recently, network coding technique has emerged as a promising approach that
supports reliable transmission over wireless loss channels. In existing
protocols where users have no interest in considering the encoded packets they
had in coding or decoding operations, this rule is expensive and inefficient.
This paper st... |
1009.0580 | Scale-free networks embedded in fractal space | cond-mat.stat-mech cs.SI physics.soc-ph | The impact of inhomogeneous arrangement of nodes in space on network
organization cannot be neglected in most of real-world scale-free networks.
Here, we wish to suggest a model for a geographical network with nodes embedded
in a fractal space in which we can tune the network heterogeneity by varying
the strength of ... |
1009.0605 | Gaussian Process Bandits for Tree Search: Theory and Application to
Planning in Discounted MDPs | cs.LG cs.AI | We motivate and analyse a new Tree Search algorithm, GPTS, based on recent
theoretical advances in the use of Gaussian Processes for Bandit problems. We
consider tree paths as arms and we assume the target/reward function is drawn
from a GP distribution. The posterior mean and variance, after observing data,
are used... |
1009.0606 | Impact of degree heterogeneity on the behavior of trapping in Koch
networks | cond-mat.stat-mech cs.SI physics.soc-ph | Previous work shows that the mean first-passage time (MFPT) for random walks
to a given hub node (node with maximum degree) in uncorrelated random
scale-free networks is closely related to the exponent $\gamma$ of power-law
degree distribution $P(k)\sim k^{-\gamma}$, which describes the extent of
heterogeneity of sca... |
1009.0623 | Weighted Attribute Fusion Model for Face Recognition | cs.CV | Recognizing a face based on its attributes is an easy task for a human to
perform as it is a cognitive process. In recent years, Face Recognition is
achieved with different kinds of facial features which were used separately or
in a combined manner. Currently, Feature fusion methods and parallel methods
are the facia... |
1009.0638 | Clique Graphs and Overlapping Communities | physics.soc-ph cs.SI physics.data-an | It is shown how to construct a clique graph in which properties of cliques of
a fixed order in a given graph are represented by vertices in a weighted graph.
Various definitions and motivations for these weights are given. The detection
of communities or clusters is used to illustrate how a clique graph may be
exploi... |
1009.0679 | Optimal Uncertainty Quantification | math.PR cs.IT math.IT math.ST physics.data-an stat.TH | We propose a rigorous framework for Uncertainty Quantification (UQ) in which
the UQ objectives and the assumptions/information set are brought to the
forefront. This framework, which we call \emph{Optimal Uncertainty
Quantification} (OUQ), is based on the observation that, given a set of
assumptions and information a... |
1009.0682 | Network coding with modular lattices | cs.IT math.IT | In [1], K\"otter and Kschischang presented a new model for error correcting
codes in network coding. The alphabet in this model is the subspace lattice of
a given vector space, a code is a subset of this lattice and the used metric on
this alphabet is the map d: (U, V) \longmapsto dim(U + V) - dim(U \bigcap V).
In th... |
1009.0744 | New and improved Johnson-Lindenstrauss embeddings via the Restricted
Isometry Property | cs.IT math.IT math.NA math.PR | Consider an m by N matrix Phi with the Restricted Isometry Property of order
k and level delta, that is, the norm of any k-sparse vector in R^N is preserved
to within a multiplicative factor of 1 +- delta under application of Phi. We
show that by randomizing the column signs of such a matrix Phi, the resulting
map wi... |
1009.0827 | A Novel Watermarking Scheme for Detecting and Recovering Distortions in
Database Tables | cs.DB | In this paper a novel fragile watermarking scheme is proposed to detect,
localize and recover malicious modifications in relational databases. In the
proposed scheme, all tuples in the database are first securely divided into
groups. Then watermarks are embedded and verified group-by-group independently.
By using the... |
1009.0842 | Empirical study and modeling of human behaviour dynamics of comments on
Blog posts | cs.SI cs.HC physics.soc-ph | On-line communities offer a great opportunity to investigate human dynamics,
because much information about individuals is registered in databases. In this
paper, based on data statistics of online comments on Blog posts, we first
present an empirical study of a comment arrival-time interval distribution. We
find tha... |
1009.0854 | Fast Color Space Transformations Using Minimax Approximations | cs.CV | Color space transformations are frequently used in image processing,
graphics, and visualization applications. In many cases, these transformations
are complex nonlinear functions, which prohibits their use in time-critical
applications. In this paper, we present a new approach called Minimax
Approximations for Color... |
1009.0861 | On the Estimation of Coherence | stat.ML cs.AI cs.LG | Low-rank matrix approximations are often used to help scale standard machine
learning algorithms to large-scale problems. Recently, matrix coherence has
been used to characterize the ability to extract global information from a
subset of matrix entries in the context of these low-rank approximations and
other samplin... |
1009.0870 | Online Advertisement, Optimization and Stochastic Networks | cs.DS cs.PF cs.SY math.OC | In this paper, we propose a stochastic model to describe how search service
providers charge client companies based on users' queries for the keywords
related to these companies' ads by using certain advertisement assignment
strategies. We formulate an optimization problem to maximize the long-term
average revenue fo... |
1009.0892 | Effective Pedestrian Detection Using Center-symmetric Local
Binary/Trinary Patterns | cs.CV | Accurately detecting pedestrians in images plays a critically important role
in many computer vision applications. Extraction of effective features is the
key to this task. Promising features should be discriminative, robust to
various variations and easy to compute. In this work, we present novel
features, termed de... |
1009.0896 | Memristor Crossbar-based Hardware Implementation of Fuzzy Membership
Functions | cs.NE cs.AI cs.AR | In May 1, 2008, researchers at Hewlett Packard (HP) announced the first
physical realization of a fundamental circuit element called memristor that
attracted so much interest worldwide. This newly found element can easily be
combined with crossbar interconnect technology which this new structure has
opened a new fiel... |
1009.0906 | Near-Oracle Performance of Greedy Block-Sparse Estimation Techniques
from Noisy Measurements | cs.IT math.IT math.ST stat.TH | This paper examines the ability of greedy algorithms to estimate a block
sparse parameter vector from noisy measurements. In particular, block sparse
versions of the orthogonal matching pursuit and thresholding algorithms are
analyzed under both adversarial and Gaussian noise models. In the adversarial
setting, it is... |
1009.0915 | Results of Evolution Supervised by Genetic Algorithms | cs.NE | A series of results of evolution supervised by genetic algorithms with
interest to agricultural and horticultural fields are reviewed. New obtained
original results from the use of genetic algorithms on structure-activity
relationships are reported.
|
1009.0921 | An Efficient Retransmission Based on Network Coding with Unicast Flows | cs.IT cs.NI math.IT | Recently, network coding technique has emerged as a promising approach that
supports reliable transmission over wireless loss channels. In existing
protocols where users have no interest in considering the encoded packets they
had in coding or decoding operations, this rule is expensive and inef-ficient.
This paper s... |
1009.0929 | Mining Target-Oriented Sequential Patterns with Time-Intervals | cs.DB | A target-oriented sequential pattern is a sequential pattern with a concerned
itemset in the end of pattern. A time-interval sequential pattern is a
sequential pattern with time-intervals between every pair of successive
itemsets. In this paper we present an algorithm to discover target-oriented
sequential pattern wi... |
1009.0932 | On the Multi-Dimensional Controller and Stopper Games | math.OC cs.SY math.PR q-fin.GN | We consider a zero-sum stochastic differential controller-and-stopper game in
which the state process is a controlled diffusion evolving in a
multi-dimensional Euclidean space. In this game, the controller affects both
the drift and the volatility terms of the state process. Under appropriate
conditions, we show that... |
1009.0957 | Distance Measures for Reduced Ordering Based Vector Filters | cs.CV | Reduced ordering based vector filters have proved successful in removing
long-tailed noise from color images while preserving edges and fine image
details. These filters commonly utilize variants of the Minkowski distance to
order the color vectors with the aim of distinguishing between noisy and
noise-free vectors. ... |
1009.0958 | Real-Time Implementation of Order-Statistics Based Directional Filters | cs.CV | Vector filters based on order-statistics have proved successful in removing
impulsive noise from color images while preserving edges and fine image
details. Among these filters, the ones that involve the cosine distance
function (directional filters) have particularly high computational
requirements, which limits the... |
1009.0959 | Cost-Effective Implementation of Order-Statistics Based Vector Filters
Using Minimax Approximations | cs.CV | Vector operators based on robust order statistics have proved successful in
digital multichannel imaging applications, particularly color image filtering
and enhancement, in dealing with impulsive noise while preserving edges and
fine image details. These operators often have very high computational
requirements whic... |
1009.0961 | A Fast Switching Filter for Impulsive Noise Removal from Color Images | cs.CV | In this paper, we present a fast switching filter for impulsive noise removal
from color images. The filter exploits the HSL color space, and is based on the
peer group concept, which allows for the fast detection of noise in a
neighborhood without resorting to pairwise distance computations between each
pixel. Exper... |
1009.0962 | Nonlinear Vector Filtering for Impulsive Noise Removal from Color Images | cs.CV | In this paper, a comprehensive survey of 48 filters for impulsive noise
removal from color images is presented. The filters are formulated using a
uniform notation and categorized into 8 families. The performance of these
filters is compared on a large set of images that cover a variety of domains
using three effecti... |
1009.0971 | ETP-Mine: An Efficient Method for Mining Transitional Patterns | cs.DB | A Transaction database contains a set of transactions along with items and
their associated timestamps. Transitional patterns are the patterns which
specify the dynamic behavior of frequent patterns in a transaction database. To
discover transitional patterns and their significant milestones, first we have
to extract... |
1009.1013 | Automatic Detection of Blue-White Veil and Related Structures in
Dermoscopy Images | cs.CV | Dermoscopy is a non-invasive skin imaging technique, which permits
visualization of features of pigmented melanocytic neoplasms that are not
discernable by examination with the naked eye. One of the most important
features for the diagnosis of melanoma in dermoscopy images is the blue-white
veil (irregular, structure... |
1009.1020 | An Improved Objective Evaluation Measure for Border Detection in
Dermoscopy Images | cs.CV | Background: Dermoscopy is one of the major imaging modalities used in the
diagnosis of melanoma and other pigmented skin lesions. Due to the difficulty
and subjectivity of human interpretation, dermoscopy image analysis has become
an important research area. One of the most important steps in dermoscopy image
analysi... |
1009.1117 | Constructions d\'efinitoires des tables du Lexique-Grammaire | cs.CL | Lexicon-Grammar tables are a very rich syntactic lexicon for the French
language. This linguistic database is nevertheless not directly suitable for
use by computer programs, as it is incomplete and lacks consistency. Tables are
defined on the basis of features which are not explicitly recorded in the
lexicon. These ... |
1009.1128 | Distributed Basis Pursuit | math.OC cs.IT cs.SY math.IT | We propose a distributed algorithm for solving the optimization problem Basis
Pursuit (BP). BP finds the least L1-norm solution of the underdetermined linear
system Ax = b and is used, for example, in compressed sensing for
reconstruction. Our algorithm solves BP on a distributed platform such as a
sensor network, an... |
1009.1132 | Efficient Collaborative Application Monitoring Scheme for Mobile
Networks | cs.MA cs.CR cs.DC | New operating systems for mobile devices allow their users to download
millions of applications created by various individual programmers, some of
which may be malicious or flawed. In order to detect that an application is
malicious, monitoring its operation in a real environment for a significant
period of time is o... |
1009.1137 | Weight Distributions of Multi-Edge type LDPC Codes | cs.IT math.IT | The multi-edge type LDPC codes, introduced by Richardson and Urbanke, present
the general class of structured LDPC codes. In this paper, we derive the
average weight distributions of the multi-edge type LDPC code ensembles.
Furthermore, we investigate the asymptotic exponential growth rate of the
average weight distr... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.