Sciweavers

1019 search results - page 161 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
MOBICOM
2009
ACM
15 years 11 months ago
Scheduling partition for order optimal capacity in large-scale wireless networks
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
Yi Xu, Wenye Wang
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
15 years 5 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
ICCV
2007
IEEE
16 years 6 months ago
A 3D Teacher for Car Detection in Aerial Images
This paper demonstrates how to reduce the hand labeling effort considerably by 3D information in an object detection task. In particular, we demonstrate how an efficient car detec...
Stefan Kluckner, Georg Pacher, Helmut Grabner, Hor...
COMPGEOM
2001
ACM
15 years 8 months ago
Discrete mobile centers
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
CORR
2011
Springer
243views Education» more  CORR 2011»
14 years 11 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari