237 search results - page 36 / 48 » Methods for Achieving Fast Query Times in Point Location Dat... |
ESORICS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Online advertising has been suffering serious click fraud problem. Fraudulent publishers can generate false clicks using malicious scripts embedded in their web pages. Ev...
ALENEX
2003
13 years 9 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
FOCS
1993
IEEE
14 years 1 days ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
Commercial datasets are often large, relational, and dynamic. They contain many records of people, places, things, events and their interactions over time. Such datasets are rarel...
BMCBI
2007
13 years 8 months ago
2007
Background: Many algorithms have been developed for deciphering the tandem mass spectrometry (MS) data sets. They can be essentially clustered into two classes. The first performs...