2962 search results - page 293 / 593 » Optimizing Spatial Data Structures For Static Data |
179
Voted
TAPSOFT
1993
Springer
15 years 10 months ago
1993
Springer
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
189
Voted
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
173
click to vote
FOCS
2006
IEEE
16 years 22 days ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
172
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
This paper addresses the problem of jointly clustering two segmentations of closely correlated images. We focus in particular on the application of reconstructing neuronal structu...
171
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
As the size and complexity of VLSI circuits increase, the need for faster floorplanning algorithms also grows. In this work we introduce Traffic, a new method for creating wire- a...