Sciweavers

153 search results - page 4 / 31
» Near-linear approximation algorithms for geometric hitting s...
Sort
View
JPDC
2007
138views more  JPDC 2007»
13 years 9 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
COCOON
2006
Springer
14 years 1 months ago
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
Marc Benkert, Joachim Gudmundsson, Christian Knaue...
WWW
2007
ACM
14 years 10 months ago
Detectives: detecting coalition hit inflation attacks in advertising networks streams
Click fraud is jeopardizing the industry of Internet advertising. Internet advertising is crucial for the thriving of the entire Internet, since it allows producers to advertise t...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
13 years 9 months ago
Geographic Quorum System Approximations
Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of...
Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew...
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
14 years 2 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani