id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
1006.5090 | PAC learnability of a concept class under non-atomic measures: a problem
by Vidyasagar | cs.LG | In response to a 1997 problem of M. Vidyasagar, we state a necessary and
sufficient condition for distribution-free PAC learnability of a concept class
$\mathscr C$ under the family of all non-atomic (diffuse) measures on the
domain $\Omega$. Clearly, finiteness of the classical Vapnik-Chervonenkis
dimension of $\mat... |
1006.5099 | Stochastic Calculus of Wrapped Compartments | cs.CE cs.FL cs.LO q-bio.QM | The Calculus of Wrapped Compartments (CWC) is a variant of the Calculus of
Looping Sequences (CLS). While keeping the same expressiveness, CWC strongly
simplifies the development of automatic tools for the analysis of biological
systems. The main simplification consists in the removal of the sequencing
operator, thus... |
1006.5166 | On Marton's Inner Bound for the General Broadcast Channel | cs.IT math.IT | We establish several new results on Marton's coding scheme and its
corresponding inner bound on the capacity region of the general broadcast
channel. We show that unlike the Gaussian case, Marton's coding scheme without
superposition coding is not optimal in general even for a degraded broadcast
channel with no commo... |
1006.5188 | Feature Construction for Relational Sequence Learning | cs.AI cs.LG | We tackle the problem of multi-class relational sequence learning using
relevant patterns discovered from a set of labelled sequences. To deal with
this problem, firstly each relational sequence is mapped into a feature vector
using the result of a feature construction method. Since, the efficacy of
sequence learning... |
1006.5226 | A Framework for Interactive Work Design based on Digital Work Analysis
and Simulation | cs.RO | Due to the flexibility and adaptability of human, manual handling work is
still very important in industry, especially for assembly and maintenance work.
Well-designed work operation can improve work efficiency and quality; enhance
safety, and lower cost. Most traditional methods for work system analysis need
physica... |
1006.5261 | Data Stream Clustering: Challenges and Issues | cs.DB cs.LG | Very large databases are required to store massive amounts of data that are
continuously inserted and queried. Analyzing huge data sets and extracting
valuable pattern in many applications are interesting for researchers. We can
identify two main groups of techniques for huge data bases mining. One group
refers to st... |
1006.5263 | Design specifications of the Human Robotic interface for the biomimetic
underwater robot "yellow submarine project" | cs.MA cs.RO | This paper describes the design of a web based multi agent design for a
collision avoidance auto navigation biomimetic submarine for submarine
hydroelectricity. The paper describes the nature of the map - topology
interface for river bodies and the design of interactive agents for the control
of the robotic submarine... |
1006.5265 | Control-theoretic Approach to Communication with Feedback: Fundamental
Limits and Code Design | cs.IT math.DS math.IT math.OC | Feedback communication is studied from a control-theoretic perspective,
mapping the communication problem to a control problem in which the control
signal is received through the same noisy channel as in the communication
problem, and the (nonlinear and time-varying) dynamics of the system determine
a subclass of enc... |
1006.5271 | Construction of Slepian-Wolf Source Code and Broadcast Channel Code
Based on Hash Property | cs.IT math.IT | The aim of this paper is to prove theorems for the Slepian-Wolf source coding
and the broadcast channel coding (independent messages and no common message)
based on the the notion of a stronger version of the hash property for an
ensemble of functions. Since an ensemble of sparse matrices has a strong hash
property, ... |
1006.5273 | Linear Detrending Subsequence Matching in Time-Series Databases | cs.DB | Each time-series has its own linear trend, the directionality of a
timeseries, and removing the linear trend is crucial to get the more intuitive
matching results. Supporting the linear detrending in subsequence matching is a
challenging problem due to a huge number of possible subsequences. In this
paper we define t... |
1006.5278 | A Survey Paper on Recommender Systems | cs.IR cs.LG | Recommender systems apply data mining techniques and prediction algorithms to
predict users' interest on information, products and services among the
tremendous amount of available items. The vast growth of information on the
Internet as well as number of visitors to websites add some key challenges to
recommender sy... |
1006.5305 | An Agent-Based Model of Collective Emotions in Online Communities | physics.soc-ph cs.MA nlin.AO | We develop a agent-based framework to model the emergence of collective
emotions, which is applied to online communities. Agents individual emotions
are described by their valence and arousal. Using the concept of Brownian
agents, these variables change according to a stochastic dynamics, which also
considers the fee... |
1006.5354 | Optimal Trade-Off for Succinct String Indexes | cs.DS cs.IT math.IT | Let s be a string whose symbols are solely available through access(i), a
read-only operation that probes s and returns the symbol at position i in s.
Many compressed data structures for strings, trees, and graphs, require two
kinds of queries on s: select(c, j), returning the position in s containing the
jth occurre... |
1006.5367 | The Link Prediction Problem in Bipartite Networks | cs.LG physics.soc-ph | We define and study the link prediction problem in bipartite networks,
specializing general link prediction algorithms to the bipartite case. In a
graph, a link prediction function of two vertices denotes the similarity or
proximity of the vertices. Common link prediction functions for general graphs
are defined usin... |
1006.5445 | Technical Report: MIMO B-MAC Interference Network Optimization under
Rate Constraints by Polite Water-filling and Duality | cs.IT math.IT | We take two new approaches to design efficient algorithms for transmitter
optimization under rate constraints to guarantee the Quality of Service in
general MIMO interference networks, named B-MAC Networks, which is a
combination of multiple interfering broadcast channels (BC) and multiaccess
channels (MAC). Two rela... |
1006.5511 | Soft Approximations and uni-int Decision Making | cs.AI | Notions of core, support and inversion of a soft set have been defined and
studied. Soft approximations are soft sets developed through core and support,
and are used for granulating the soft space. Membership structure of a soft set
has been probed in and many interesting properties presented. The mathematical
appar... |
1006.5657 | Reasoning Support for Risk Prediction and Prevention in Independent
Living | cs.AI | In recent years there has been growing interest in solutions for the delivery
of clinical care for the elderly, due to the large increase in aging
population. Monitoring a patient in his home environment is necessary to ensure
continuity of care in home settings, but, to be useful, this activity must not
be too invas... |
1006.5677 | Shape of Traveling Densities with Extremum Statistical Complexity | nlin.PS cs.IT math.IT | In this paper, we analyze the behavior of statistical complexity in several
systems where two identical densities that travel in opposite direction cross
each other. Besides the crossing between two Gaussian, rectangular and
triangular densities studied in a previous work, we also investigate in detail
the crossing b... |
1006.5686 | Geometric Approximations of Some Aloha-like Stability Regions | cs.IT math.IT | Most bounds on the stability region of Aloha give necessary and sufficient
conditions for the stability of an arrival rate vector under a specific
contention probability (control) vector. But such results do not yield
easy-to-check bounds on the overall Aloha stability region because they
potentially require checking... |
1006.5739 | Polyharmonic Daubechies type wavelets in Image Processing and Astronomy,
II | math.NA cs.CV | We consider the application of the polyharmonic subdivision wavelets (of
Daubechies type) to Image Processing, in particular to Astronomical Images. The
results show an essential advantage over some standard multivariate wavelets
and a potential for better compression.
|
1006.5745 | Evolutionary Computation Algorithms for Cryptanalysis: A Study | cs.CR cs.NE | The cryptanalysis of various cipher problems can be formulated as NP-Hard
combinatorial problem. Solving such problems requires time and/or memory
requirement which increases with the size of the problem. Techniques for
solving combinatorial problems fall into two broad groups - exact algorithms
and Evolutionary Comp... |
1006.5762 | Construction and Applications of CRT Sequences | cs.IT math.IT | Protocol sequences are used for channel access in the collision channel
without feedback. Each user accesses the channel according to a deterministic
zero-one pattern, called the protocol sequence. In order to minimize
fluctuation of throughput due to delay offsets, we want to construct protocol
sequences whose pairw... |
1006.5787 | Fatigue evaluation in maintenance and assembly operations by digital
human simulation | cs.RO | Virtual human techniques have been used a lot in industrial design in order
to consider human factors and ergonomics as early as possible. The physical
status (the physical capacity of virtual human) has been mostly treated as
invariable in the current available human simulation tools, while indeed the
physical capac... |
1006.5794 | Report on the XBase Project | cs.DB | This project addressed the conceptual fundamentals of data storage,
investigating techniques for provision of highly generic storage facilities
that can be tailored to produce various individually customised storage
infrastructures, compliant to the needs of particular applications. This
requires the separation of me... |
1006.5802 | On Graphs and Codes Preserved by Edge Local Complementation | math.CO cs.IT math.IT | Orbits of graphs under local complementation (LC) and edge local
complementation (ELC) have been studied in several different contexts. For
instance, there are connections between orbits of graphs and error-correcting
codes. We define a new graph class, ELC-preserved graphs, comprising all graphs
that have an ELC orb... |
1006.5827 | Approximate Robotic Mapping from sonar data by modeling Perceptions with
Antonyms | cs.RO cs.CL | This work, inspired by the idea of "Computing with Words and Perceptions"
proposed by Zadeh in 2001, focuses on how to transform measurements into
perceptions for the problem of map building by Autonomous Mobile Robots. We
propose to model the perceptions obtained from sonar-sensors as two grid maps:
one for obstacle... |
1006.5829 | Online Event Segmentation in Active Perception using Adaptive Strong
Anticipation | cs.RO | Most cognitive architectures rely on discrete representation, both in space
(e.g., objects) and in time (e.g., events). However, a robot interaction with
the world is inherently continuous, both in space and in time. The segmentation
of the stream of perceptual inputs a robot receives into discrete and
meaningful eve... |
1006.5877 | RoboCast: Asynchronous Communication in Robot Networks | cs.DC cs.RO | This paper introduces the \emph{RoboCast} communication abstraction. The
RoboCast allows a swarm of non oblivious, anonymous robots that are only
endowed with visibility sensors and do not share a common coordinate system, to
asynchronously exchange information. We propose a generic framework that covers
a large clas... |
1006.5879 | Secure Transmission with Multiple Antennas II: The MIMOME Wiretap
Channel | cs.IT cs.CR math.IT | The capacity of the Gaussian wiretap channel model is analyzed when there are
multiple antennas at the sender, intended receiver and eavesdropper. The
associated channel matrices are fixed and known to all the terminals. A
computable characterization of the secrecy capacity is established as the
saddle point solution... |
1006.5880 | Testing SDRT's Right Frontier | cs.CL | The Right Frontier Constraint (RFC), as a constraint on the attachment of new
constituents to an existing discourse structure, has important implications for
the interpretation of anaphoric elements in discourse and for Machine Learning
(ML) approaches to learning discourse structures. In this paper we provide
strong... |
1006.5894 | A possible intrinsic weakness of AES and other cryptosystems | cs.IT cs.CR math.IT | It has been suggested that the algebraic structure of AES (and other similar
block ciphers) could lead to a weakness exploitable in new attacks. In this
paper, we use the algebraic structure of AES-like ciphers to construct a cipher
embedding where the ciphers may lose their non-linearity. We show some examples
and w... |
1006.5896 | Counterexample Guided Abstraction Refinement Algorithm for Propositional
Circumscription | cs.AI cs.LO | Circumscription is a representative example of a nonmonotonic reasoning
inference technique. Circumscription has often been studied for first order
theories, but its propositional version has also been the subject of extensive
research, having been shown equivalent to extended closed world assumption
(ECWA). Moreover... |
1006.5901 | Secret key agreement on wiretap channels with transmitter side
information | cs.IT math.IT | Secret-key agreement protocols over wiretap channels controlled by a state
parameter are studied. The entire state sequence is known (non-causally) to the
sender but not to the receiver and the eavesdropper. Upper and lower bounds on
the secret-key capacity are established both with and without public
discussion. The... |
1006.5902 | Performance Comparison of SVM and ANN for Handwritten Devnagari
Character Recognition | cs.CV | Classification methods based on learning from examples have been widely
applied to character recognition from the 1990s and have brought forth
significant improvements of recognition accuracies. This class of methods
includes statistical methods, artificial neural networks, support vector
machines (SVM), multiple cla... |
1006.5908 | Recognition of Non-Compound Handwritten Devnagari Characters using a
Combination of MLP and Minimum Edit Distance | cs.CV | This paper deals with a new method for recognition of offline Handwritten
non-compound Devnagari Characters in two stages. It uses two well known and
established pattern recognition techniques: one using neural networks and the
other one using minimum edit distance. Each of these techniques is applied on
different se... |
1006.5911 | Application of Statistical Features in Handwritten Devnagari Character
Recognition | cs.CV | In this paper a scheme for offline Handwritten Devnagari Character
Recognition is proposed, which uses different feature extraction methodologies
and recognition algorithms. The proposed system assumes no constraints in
writing style or size. First the character is preprocessed and features namely
: Chain code histog... |
1006.5913 | Multiple Classifier Combination for Off-line Handwritten Devnagari
Character Recognition | cs.CV | This work presents the application of weighted majority voting technique for
combination of classification decision obtained from three Multi_Layer
Perceptron(MLP) based classifiers for Recognition of Handwritten Devnagari
characters using three different feature sets. The features used are
intersection, shadow featu... |
1006.5920 | A Two Stage Classification Approach for Handwritten Devanagari
Characters | cs.CV | The paper presents a two stage classification approach for handwritten
devanagari characters The first stage is using structural properties like
shirorekha, spine in character and second stage exploits some intersection
features of characters which are fed to a feedforward neural network. Simple
histogram based metho... |
1006.5924 | A novel approach for handwritten Devnagari character recognition | cs.CV | In this paper a method for recognition of handwritten devanagari characters
is described. Here, feature vector is constituted by accumulated directional
gradient changes in different segments, number of intersections points for the
character, type of spine present and type of shirorekha present in the
character. One ... |
1006.5927 | Classification Of Gradient Change Features Using MLP For Handwritten
Character Recognition | cs.CV | A novel, generic scheme for off-line handwritten English alphabets character
images is proposed. The advantage of the technique is that it can be applied in
a generic manner to different applications and is expected to perform better in
uncertain and noisy environments. The recognition scheme is using a multilayer
pe... |
1006.5938 | Secure Transmission with Artificial Noise over Fading Channels:
Achievable Rate and Optimal Power Allocation | cs.IT math.IT | We consider the problem of secure communication with multi-antenna
transmission in fading channels. The transmitter simultaneously transmits an
information bearing signal to the intended receiver and artificial noise to the
eavesdroppers. We obtain an analytical closed-form expression of an achievable
secrecy rate, a... |
1006.5942 | FPGA Based Assembling of Facial Components for Human Face Construction | cs.CV | This paper aims at VLSI realization for generation of a new face from textual
description. The FASY (FAce SYnthesis) System is a Face Database Retrieval and
new Face generation System that is under development. One of its main features
is the generation of the requested face when it is not found in the existing
datab... |
1006.5945 | Fuzzy Classification of Facial Component Parameters | cs.CV | This paper presents a novel type-2 Fuzzy logic System to define the Shape of
a facial component with the crisp output. This work is the part of our main
research effort to design a system (called FASY) which offers a novel face
construction approach based on the textual description and also extracts and
analyzes the ... |
1007.0085 | Survey of Nearest Neighbor Techniques | cs.CV | The nearest neighbor (NN) technique is very simple, highly efficient and
effective in the field of pattern recognition, text categorization, object
recognition etc. Its simplicity is its main advantage, but the disadvantages
can't be ignored even. The memory requirement and computation complexity also
matter. Many te... |
1007.0097 | On Pairs of $f$-divergences and their Joint Range | cs.IT math.IT math.ST stat.TH | We compare two f-divergences and prove that their joint range is the convex
hull of the joint range for distributions supported on only two points. Some
applications of this result are given.
|
1007.0199 | Optimal execution strategy in the presence of permanent price impact and
fixed transaction cost | q-fin.TR cs.SY math.OC math.PR | We study a single risky financial asset model subject to price impact and
transaction cost over an infinite horizon. An investor needs to execute a long
position in the asset affecting the price of the asset and possibly incurring
in fixed transaction cost. The objective is to maximize the discounted revenue
obtained... |
1007.0210 | Uncertainty of visual measurement and efficient allocation of sensory
resources | q-bio.NC cs.CV cs.IT math.IT | We review the reasoning underlying two approaches to combination of sensory
uncertainties. First approach is noncommittal, making no assumptions about
properties of uncertainty or parameters of stimulation. Then we explain the
relationship between this approach and the one commonly used in modeling
"higher level" asp... |
1007.0267 | Interference Channel with an Out-of-Band Relay | cs.IT math.IT | A Gaussian interference channel (IC) with a relay is considered. The relay is
assumed to operate over an orthogonal band with respect to the underlying IC,
and the overall system is referred to as IC with an out-of-band relay (IC-OBR).
The system can be seen as operating over two parallel interference-limited
channel... |
1007.0273 | New Common Proper-Motion Pairs From the PPMX Catalog | astro-ph.SR cs.DB | We use data mining techniques for finding 82 previously unreported common
proper motion pairs from the PPM-Extended catalogue. Special-purpose software
automating the different phases of the process has been developed. The software
simplifies the detection of the new pairs by integrating a set of basic
operations ove... |
1007.0296 | A Bayesian View of the Poisson-Dirichlet Process | math.ST cs.LG math.PR stat.TH | The two parameter Poisson-Dirichlet Process (PDP), a generalisation of the
Dirichlet Process, is increasingly being used for probabilistic modelling in
discrete areas such as language technology, bioinformatics, and image analysis.
There is a rich literature about the PDP and its derivative distributions such
as the ... |
1007.0313 | Repairing People Trajectories Based on Point Clustering | cs.CV | This paper presents a method for improving any object tracking algorithm
based on machine learning. During the training phase, important trajectory
features are extracted which are then used to calculate a confidence value of
trajectory. The positions at which objects are usually lost and found are
clustered in order... |
1007.0357 | Transfer Entropy on Rank Vectors | nlin.CD cs.IT math.IT physics.data-an stat.ME | Transfer entropy (TE) is a popular measure of information flow found to
perform consistently well in different settings. Symbolic transfer entropy
(STE) is defined similarly to TE but on the ranks of the components of the
reconstructed vectors rather than the reconstructed vectors themselves. First,
we correct STE by... |
1007.0376 | The Transfer of Evolved Artificial Immune System Behaviours between
Small and Large Scale Robotic Platforms | cs.NE cs.RO | This paper demonstrates that a set of behaviours evolved in simulation on a
miniature robot (epuck) can be transferred to a much larger scale platform (a
virtual Pioneer P3-DX) that also differs in shape, sensor type, sensor
configuration and programming interface. The chosen architecture uses a
reinforcement learnin... |
1007.0379 | Reliability Distributions of Truncated Max-log-map (MLM) Detectors
Applied to ISI Channels | cs.IT math.IT | The max-log-map (MLM) receiver is an approximated version of the well-known,
Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm. The MLM algorithm is attractive due
to its implementation simplicity. In practice, sliding-window implementations
are preferred; these practical implementations consider truncated signaling
neighbor... |
1007.0380 | Additive Non-negative Matrix Factorization for Missing Data | cs.NA cs.LG | Non-negative matrix factorization (NMF) has previously been shown to be a
useful decomposition for multivariate data. We interpret the factorization in a
new way and use it to generate missing attributes from test data. We provide a
joint optimization scheme for the missing attributes as well as the NMF
factors. We p... |
1007.0394 | Non-uniform state space reconstruction and coupling detection | nlin.CD cs.IT math.IT physics.data-an q-bio.NC stat.ME | We investigate the state space reconstruction from multiple time series
derived from continuous and discrete systems and propose a method for building
embedding vectors progressively using information measure criteria regarding
past, current and future states. The embedding scheme can be adapted for
different purpose... |
1007.0404 | Quasi-Cyclic Asymptotically Regular LDPC Codes | cs.IT math.IT | Families of "asymptotically regular" LDPC block code ensembles can be formed
by terminating (J,K)-regular protograph-based LDPC convolutional codes. By
varying the termination length, we obtain a large selection of LDPC block code
ensembles with varying code rates, minimum distance that grows linearly with
block leng... |
1007.0408 | Privacy in geo-social networks: proximity notification with untrusted
service providers and curious buddies | cs.DB cs.CR | A major feature of the emerging geo-social networks is the ability to notify
a user when one of his friends (also called buddies) happens to be
geographically in proximity with the user. This proximity service is usually
offered by the network itself or by a third party service provider (SP) using
location data acqui... |
1007.0412 | Improving Iris Recognition Accuracy By Score Based Fusion Method | cs.AI | Iris recognition technology, used to identify individuals by photographing
the iris of their eye, has become popular in security applications because of
its ease of use, accuracy, and safety in controlling access to high-security
areas. Fusion of multiple algorithms for biometric verification performance
improvement ... |
1007.0417 | Delta Learning Rule for the Active Sites Model | cs.NE | This paper reports the results on methods of comparing the memory retrieval
capacity of the Hebbian neural network which implements the B-Matrix approach,
by using the Widrow-Hoff rule of learning. We then, extend the recently
proposed Active Sites model by developing a delta rule to increase memory
capacity. Also, t... |
1007.0436 | Transmit Energy Focusing for DOA Estimation in MIMO Radar with Colocated
Antennas | cs.IT math.IT | In this paper, we propose a transmit beamspace energy focusing technique for
multiple-input multiple-output (MIMO) radar with application to direction
finding for multiple targets. The general angular directions of the targets are
assumed to be located within a certain spatial sector. We focus the energy of
multiple ... |
1007.0449 | Unimodular Lattices for the Gaussian Wiretap Channel | cs.IT cs.CR math.IT | In a recent paper, the authors introduced a lattice invariant called "Secrecy
Gain" which measures the confusion experienced by a passive eavesdropper on the
Gaussian Wiretap Channel. We study, here, the behavior of this invariant for
unimodular lattices by using tools from Modular Forms and show that, for some
famil... |
1007.0465 | On the Solvability of 2-pair Unicast Networks --- A Cut-based
Characterization | cs.IT math.IT | In this paper, we propose a subnetwork decomposition/combination approach to
investigate the single rate $2$-pair unicast problem. It is shown that the
solvability of a $2$-pair unicast problem is completely determined by four
specific link subsets, namely, $\mathcal A_{1,1}$, $\mathcal A_{2,2}$,
$\mathcal A_{1,2}$ a... |
1007.0481 | IMP: A Message-Passing Algorithmfor Matrix Completion | cs.IT cs.LG math.IT | A new message-passing (MP) method is considered for the matrix completion
problem associated with recommender systems. We attack the problem using a
(generative) factor graph model that is related to a probabilistic low-rank
matrix factorization. Based on the model, we propose a new algorithm, termed
IMP, for the rec... |
1007.0484 | Query Strategies for Evading Convex-Inducing Classifiers | cs.LG cs.CR cs.GT | Classifiers are often used to detect miscreant activities. We study how an
adversary can systematically query a classifier to elicit information that
allows the adversary to evade detection while incurring a near-minimal cost of
modifying their intended malfeasance. We generalize the theory of Lowd and Meek
(2005) to... |
1007.0496 | Perturbed Hankel Determinants: Applications to the Information Theory of
MIMO Wireless Communications | cs.IT math.IT | In this paper we compute two important information-theoretic quantities which
arise in the application of multiple-input multiple-output (MIMO) antenna
wireless communication systems: the distribution of the mutual information of
multi-antenna Gaussian channels, and the Gallager random coding upper bound on
the error... |
1007.0512 | User Partitioning for Less Overhead in MIMO Interference Channels | cs.IT math.IT | This paper presents a study on multiple-antenna interference channels,
accounting for general overhead as a function of the number of users and
antennas in the network. The model includes both perfect and imperfect channel
state information based on channel estimation in the presence of noise. Three
low complexity me... |
1007.0522 | Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and
Optimality | cs.IT cs.NI math.IT | Streaming erasure codes guarantee that each source packet is recovered within
a fixed delay at the receiver over a burst-erasure channel. This paper
introduces a new class of streaming codes: Diversity Embedded Streaming Erasure
Codes (DE-SCo), that provide a flexible tradeoff between the channel quality
and receiver... |
1007.0528 | Binary Independent Component Analysis with OR Mixtures | cs.IT cs.NI math.IT | Independent component analysis (ICA) is a computational method for separating
a multivariate signal into subcomponents assuming the mutual statistical
independence of the non-Gaussian source signals. The classical Independent
Components Analysis (ICA) framework usually assumes linear combinations of
independent sourc... |
1007.0546 | Computational Model of Music Sight Reading: A Reinforcement Learning
Approach | cs.AI cs.LG cs.NE math.OC | Although the Music Sight Reading process has been studied from the cognitive
psychology view points, but the computational learning methods like the
Reinforcement Learning have not yet been used to modeling of such processes. In
this paper, with regards to essential properties of our specific problem, we
consider the... |
1007.0547 | A Fast Decision Technique for Hierarchical Hough Transform for Line
Detection | cs.CV | Many techniques have been proposed to speedup the performance of classic
Hough Transform. These techniques are primarily based on converting the voting
procedure to a hierarchy based voting method. These methods use approximate
decision-making process. In this paper, we propose a fast decision making
process that enh... |
1007.0548 | A Reinforcement Learning Model Using Neural Networks for Music Sight
Reading Learning Problem | cs.LG cs.NE | Music Sight Reading is a complex process in which when it is occurred in the
brain some learning attributes would be emerged. Besides giving a model based
on actor-critic method in the Reinforcement Learning, the agent is considered
to have a neural network structure. We studied on where the sight reading
process is ... |
1007.0549 | Minimax Manifold Estimation | stat.ML cs.LG math.ST stat.TH | We find the minimax rate of convergence in Hausdorff distance for estimating
a manifold M of dimension d embedded in R^D given a noisy sample from the
manifold. We assume that the manifold satisfies a smoothness condition and that
the noise distribution has compact support. We show that the optimal rate of
convergenc... |
1007.0563 | Graphical Models as Block-Tree Graphs | stat.ML cs.IT math.IT math.PR | We introduce block-tree graphs as a framework for deriving efficient
algorithms on graphical models. We define block-tree graphs as a
tree-structured graph where each node is a cluster of nodes such that the
clusters in the graph are disjoint. This differs from junction-trees, where two
clusters connected by an edge ... |
1007.0566 | Organisation of signal flow in directed networks | physics.data-an cond-mat.dis-nn cs.SI physics.bio-ph physics.soc-ph stat.OT | Confining an answer to the question whether and how the coherent operation of
network elements is determined by the the network structure is the topic of our
work. We map the structure of signal flow in directed networks by analysing the
degree of edge convergence and the overlap between the in- and output sets of
an... |
1007.0571 | Quickest Detection with Social Learning: Interaction of local and global
decision makers | cs.GT cs.IT math.IT stat.ME | We consider how local and global decision policies interact in stopping time
problems such as quickest time change detection. Individual agents make myopic
local decisions via social learning, that is, each agent records a private
observation of a noisy underlying state process, selfishly optimizes its local
utility ... |
1007.0602 | On The Complexity and Completeness of Static Constraints for Breaking
Row and Column Symmetry | cs.AI cs.CC | We consider a common type of symmetry where we have a matrix of decision
variables with interchangeable rows and columns. A simple and efficient method
to deal with such row and column symmetry is to post symmetry breaking
constraints like DOUBLELEX and SNAKELEX. We provide a number of positive and
negative results o... |
1007.0603 | Decomposition of the NVALUE constraint | cs.AI | We study decompositions of the global NVALUE constraint. Our main
contribution is theoretical: we show that there are propagators for global
constraints like NVALUE which decomposition can simulate with the same time
complexity but with a much greater space complexity. This suggests that the
benefit of a global propa... |
1007.0604 | Symmetry within and between solutions | cs.AI | Symmetry can be used to help solve many problems. For instance, Einstein's
famous 1905 paper ("On the Electrodynamics of Moving Bodies") uses symmetry to
help derive the laws of special relativity. In artificial intelligence,
symmetry has played an important role in both problem representation and
reasoning. I descri... |
1007.0614 | Online Cake Cutting | cs.AI | We propose an online form of the cake cutting problem. This models situations
where players arrive and depart during the process of dividing a resource. We
show that well known fair division procedures like cut-and-choose and the
Dubins-Spanier moving knife procedure can be adapted to apply to such online
problems. W... |
1007.0618 | Face Synthesis (FASY) System for Determining the Characteristics of a
Face Image | cs.CV | This paper aims at determining the characteristics of a face image by
extracting its components. The FASY (FAce SYnthesis) System is a Face Database
Retrieval and new Face generation System that is under development. One of its
main features is the generation of the requested face when it is not found in
the existing... |
1007.0620 | Quotient Based Multiresolution Image Fusion of Thermal and Visual Images
Using Daubechies Wavelet Transform for Human Face Recognition | cs.CV | This paper investigates the multiresolution level-1 and level-2 Quotient
based Fusion of thermal and visual images. In the proposed system, the method-1
namely "Decompose then Quotient Fuse Level-1" and the method-2 namely
"Decompose-Reconstruct then Quotient Fuse Level-2" both work on wavelet
transformations of the ... |
1007.0621 | Fusion of Daubechies Wavelet Coefficients for Human Face Recognition | cs.CV | In this paper fusion of visual and thermal images in wavelet transformed
domain has been presented. Here, Daubechies wavelet transform, called as D2,
coefficients from visual and corresponding coefficients computed in the same
manner from thermal images are combined to get fused coefficients. After
decomposition up t... |
1007.0626 | Fusion of Wavelet Coefficients from Visual and Thermal Face Images for
Human Face Recognition - A Comparative Study | cs.CV | In this paper we present a comparative study on fusion of visual and thermal
images using different wavelet transformations. Here, coefficients of discrete
wavelet transforms from both visual and thermal images are computed separately
and combined. Next, inverse discrete wavelet transformation is taken in order
to ob... |
1007.0627 | A Parallel Framework for Multilayer Perceptron for Human Face
Recognition | cs.CV | Artificial neural networks have already shown their success in face
recognition and similar complex pattern recognition tasks. However, a major
disadvantage of the technique is that it is extremely slow during training for
larger classes and hence not suitable for real-time complex problems such as
pattern recognitio... |
1007.0628 | Image Pixel Fusion for Human Face Recognition | cs.CV | In this paper we present a technique for fusion of optical and thermal face
images based on image pixel fusion approach. Out of several factors, which
affect face recognition performance in case of visual images, illumination
changes are a significant factor that needs to be addressed. Thermal images are
better in ha... |
1007.0631 | Classification of Fused Images using Radial Basis Function Neural
Network for Human Face Recognition | cs.CV | Here an efficient fusion technique for automatic face recognition has been
presented. Fusion of visual and thermal images has been done to take the
advantages of thermal images as well as visual images. By employing fusion a
new image can be obtained, which provides the most detailed, reliable, and
discriminating inf... |
1007.0633 | Classification of fused face images using multilayer perceptron neural
network | cs.CV | This paper presents a concept of image pixel fusion of visual and thermal
faces, which can significantly improve the overall performance of a face
recognition system. Several factors affect face recognition performance
including pose variations, facial expression changes, occlusions, and most
importantly illumination... |
1007.0636 | Classification of Log-Polar-Visual Eigenfaces using Multilayer
Perceptron | cs.CV | In this paper we present a simple novel approach to tackle the challenges of
scaling and rotation of face images in face recognition. The proposed approach
registers the training and testing visual face images by log-polar
transformation, which is capable to handle complicacies introduced by scaling
and rotation. Log... |
1007.0637 | Local search for stable marriage problems with ties and incomplete lists | cs.AI | The stable marriage problem has a wide variety of practical applications,
ranging from matching resident doctors to hospitals, to matching students to
schools, or more generally to any two-sided market. We consider a useful
variation of the stable marriage problem, where the men and women express their
preferences us... |
1007.0638 | Human Face Recognition using Line Features | cs.CV | In this work we investigate a novel approach to handle the challenges of face
recognition, which includes rotation, scale, occlusion, illumination etc. Here,
we have used thermal face images as those are capable to minimize the affect of
illumination changes and occlusion due to moustache, beards, adornments etc.
The... |
1007.0660 | The Latent Bernoulli-Gauss Model for Data Analysis | cs.LG | We present a new latent-variable model employing a Gaussian mixture
integrated with a feature selection procedure (the Bernoulli part of the model)
which together form a "Latent Bernoulli-Gauss" distribution. The model is
applied to MAP estimation, clustering, feature selection and collaborative
filtering and fares f... |
1007.0690 | A unified view of Automata-based algorithms for Frequent Episode
Discovery | cs.AI | Frequent Episode Discovery framework is a popular framework in Temporal Data
Mining with many applications. Over the years many different notions of
frequencies of episodes have been proposed along with different algorithms for
episode discovery. In this paper we present a unified view of all such
frequency counting ... |
1007.0728 | Artificial Learning in Artificial Memories | cs.AI q-bio.NC | Memory refinements are designed below to detect those sequences of actions
that have been repeated a given number n. Subsequently such sequences are
permitted to run without CPU involvement. This mimics human learning. Actions
are rehearsed and once learned, they are performed automatically without
conscious involvem... |
1007.0776 | Is Computational Complexity a Barrier to Manipulation? | cs.AI cs.CC cs.GT | When agents are acting together, they may need a simple mechanism to decide
on joint actions. One possibility is to have the agents express their
preferences in the form of a ballot and use a voting rule to decide the winning
action(s). Unfortunately, agents may try to manipulate such an election by
misreporting thei... |
1007.0799 | Fountain Codes with Multiplicatively Repeated Non-Binary LDPC Codes | cs.IT math.IT | We study fountain codes transmitted over the binary-input symmetric-output
channel. For channels with small capacity, receivers needs to collects many
channel outputs to recover information bits. Since a collected channel output
yields a check node in the decoding Tanner graph, the channel with small
capacity leads t... |
1007.0803 | Soft Control on Collective Behavior of a Group of Autonomous Agents by a
Shill Agent | cs.MA | This paper asks a new question: how can we control the collective behavior of
self-organized multi-agent systems? We try to answer the question by proposing
a new notion called 'Soft Control', which keeps the local rule of the existing
agents in the system. We show the feasibility of soft control by a case study.
Con... |
1007.0824 | Filtrage vaste marge pour l'\'etiquetage s\'equentiel \`a noyaux de
signaux | cs.LG | We address in this paper the problem of multi-channel signal sequence
labeling. In particular, we consider the problem where the signals are
contaminated by noise or may present some dephasing with respect to their
labels. For that, we propose to jointly learn a SVM sample classifier with a
temporal filtering of the ... |
1007.0859 | Local search for stable marriage problems | cs.AI | The stable marriage (SM) problem has a wide variety of practical
applications, ranging from matching resident doctors to hospitals, to matching
students to schools, or more generally to any two-sided market. In the
classical formulation, n men and n women express their preferences (via a
strict total order) over the ... |
1007.0875 | On the Capacity Achieving Covariance Matrix for Frequency Selective MIMO
Channels Using the Asymptotic Approach | cs.IT math.IT | In this contribution, an algorithm for evaluating the capacity-achieving
input covariance matrices for frequency selective Rayleigh MIMO channels is
proposed. In contrast with the flat fading Rayleigh case, no closed-form
expressions for the eigenvectors of the optimum input covariance matrix are
available. Classical... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.