23 search results - page 5 / 5 » Near-Optimal Sublinear Time Algorithms for Ulam Distance |
125
Voted
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
121
Voted
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
102
Voted
ICRA
2010
IEEE
14 years 11 months ago
2010
IEEE
We propose a novel solution to object detection, localization and pose estimation with applications in robot vision. The proposed method is especially applicable when the objects ...