Sciweavers

105 search results - page 8 / 21
» Nonlinear Filtering of Convex Sets of Probability Distributi...
Sort
View
INFOCOM
2006
IEEE
14 years 22 days ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
ICIP
2009
IEEE
13 years 4 months ago
Shapes as empirical distributions
We address the problem of shape based classification. We interpret the shape of an object as a probability distribution governing the location of the points of the object. An imag...
Bernardo Rodrigues Pires, José M. F. Moura
CORR
2002
Springer
113views Education» more  CORR 2002»
13 years 6 months ago
Robust Global Localization Using Clustered Particle Filtering
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
Javier Nicolás Sánchez, Adam Milstei...
ATAL
2008
Springer
13 years 8 months ago
Non-linear dynamics in multiagent reinforcement learning algorithms
Several multiagent reinforcement learning (MARL) algorithms have been proposed to optimize agents' decisions. Only a subset of these MARL algorithms both do not require agent...
Sherief Abdallah, Victor R. Lesser
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 7 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu