Sciweavers

1093 search results - page 69 / 219
» Crossover in Probability Spaces
Sort
View
104
Voted
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
15 years 1 months ago
Entropy-preserving cuttings and space-efficient planar point location
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
Sunil Arya, Theocharis Malamatos, David M. Mount
IJON
2002
105views more  IJON 2002»
15 years 7 days ago
Separation of sources using simulated annealing and competitive learning
This paper presents a new adaptive procedure for the linear and non-linear separation of signals with non-uniform, symmetrical probability distributions, based on both simulated a...
Carlos García Puntonet, Ali Mansour, Christ...
94
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Statistical Resolution Limit for source localization in a MIMO context
In this paper, we derive the Multidimensional Statistical Resolution Limit (MSRL) to resolve two closely spaced targets using a widely spaced MIMO radar. Toward this end, we perfo...
Mohammed Nabil El Korso, Rémy Boyer, Alexan...
ICASSP
2011
IEEE
14 years 4 months ago
Subspace pursuit method for kernel-log-linear models
This paper presents a novel method for reducing the dimensionality of kernel spaces. Recently, to maintain the convexity of training, loglinear models without mixtures have been u...
Yotaro Kubo, Simon Wiesler, Ralf Schlüter, He...
95
Voted
AIPS
2008
15 years 2 months ago
Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a p...
Abdeslam Boularias, Brahim Chaib-draa