11211 search results - page 2141 / 2243 » Data Structures |
139
click to vote
STOC
1993
ACM
15 years 2 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
116
Voted
POPL
1992
ACM
15 years 2 months ago
1992
ACM
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...
COMPGEOM
2007
ACM
15 years 2 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
121
Voted
GRAPHITE
2007
ACM
15 years 2 months ago
2007
ACM
Because of their geometric complexity, high resolution 3D models, either designed in high-end modeling packages or acquired with range scanning devices, cannot be directly used in...
103
Voted
ESORICS
2009
Springer
15 years 2 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...