Sciweavers

5169 search results - page 107 / 1034
» Locality approximation using time
Sort
View
ICPR
2006
IEEE
16 years 5 months ago
Multiple Object Tracking Using Local PCA
Tracking multiple interacting objects represents a challenging area in computer vision. The tracking problem in general can be formulated as the task of recovering the spatio-temp...
Bernhard Frühstück, Csaba Beleznai, Hors...
KES
2004
Springer
15 years 10 months ago
Extracting Stellar Population Parameters of Galaxies from Photometric Data Using Evolution Strategies and Locally Weighted Linea
There is now a huge amount of high quality photometric data available in the literature whose analysis is bound to play a fundamental role in studies of the formation and evolution...
Luis Alvarez, Olac Fuentes, Roberto Terlevich
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 9 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
COMPGEOM
2006
ACM
15 years 10 months ago
Lower bounds on locality sensitive hashing
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
Rajeev Motwani, Assaf Naor, Rina Panigrahy
AI
2006
Springer
15 years 8 months ago
Partial Local FriendQ Multiagent Learning: Application to Team Automobile Coordination Problem
Real world multiagent coordination problems are important issues for reinforcement learning techniques. In general, these problems are partially observable and this characteristic ...
Julien Laumonier, Brahim Chaib-draa