Sciweavers

1632 search results - page 49 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
16 years 3 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
ICRA
2008
IEEE
125views Robotics» more  ICRA 2008»
15 years 9 months ago
An approximation algorithm for the least overlapping p-Frame problem with non-partial coverage for networked robotic cameras
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
Yiliang Xu, Dezhen Song, Jingang Yi, A. Frank van ...
151
Voted
JMLR
2012
13 years 5 months ago
A metric learning perspective of SVM: on the relation of LMNN and SVM
Support Vector Machines, SVMs, and the Large Margin Nearest Neighbor algorithm, LMNN, are two very popular learning algorithms with quite different learning biases. In this paper...
Huyen Do, Alexandros Kalousis, Jun Wang, Adam Wozn...
117
Voted
IROS
2008
IEEE
119views Robotics» more  IROS 2008»
15 years 9 months ago
A relative information metric for vehicle following systems
— Vehicle following can be achieved by minimizing the relative information (Kullback-Leibler or K-L distance), between the estimated poses of leader and follower vehicles by form...
Teck Chew Ng, Martin David Adams, Javier Ibanez Gu...
151
Voted
ICDE
2009
IEEE
125views Database» more  ICDE 2009»
15 years 1 months ago
Metric Functional Dependencies
When merging data from various sources, it is often the case that small variations in data format and interpretation cause traditional functional dependencies (FDs) to be violated,...
Nick Koudas, Avishek Saha, Divesh Srivastava, Sure...