94 search results - page 8 / 19 » Scalable Precomputed Search Trees |
TCAD
2010
13 years 3 months ago
2010
In this paper, we present DeFer--a fast, high-quality, scalable, and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a nonslicing floorplan by compacting a sli...
SIGGRAPH
2000
ACM
14 years 28 days ago
2000
ACM
Approximating detailed models with coarse, texture-mapped meshes results in polygonal silhouettes. To eliminate this artifact, we introduce silhouette clipping, a framework for ef...
IPPS
1999
IEEE
14 years 26 days ago
1999
IEEE
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
COMPSAC
2002
IEEE
14 years 1 months ago
2002
IEEE
Services for locating mobile objects are often organized as a distributed search tree. The advantage of such an organization is that the service can easily scale as a distributed ...
ANCS
2009
ACM
13 years 6 months ago
2009
ACM
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...