Sciweavers

1950 search results - page 381 / 390
» Varieties of Increasing Trees
Sort
View
SOFSEM
2000
Springer
14 years 5 days ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
VLDB
1995
ACM
121views Database» more  VLDB 1995»
14 years 4 days ago
Benchmarking Spatial Join Operations with Spatial Output
The spatial join operation is benchmarked using variants of well-known spatial data structures such as the R-tree, R-tree, R+-tree, and the PMR quadtree. The focus is on a spatia...
Erik G. Hoel, Hanan Samet
ASPDAC
2008
ACM
154views Hardware» more  ASPDAC 2008»
13 years 10 months ago
Exploring high-speed low-power hybrid arithmetic units at scaled supply and adaptive clock-stretching
Meeting power and performance requirement is a challenging task in high speed ALUs. Supply voltage scaling is promising because it reduces both switching and active power but it al...
Swaroop Ghosh, Kaushik Roy
DAGSTUHL
2010
13 years 10 months ago
CSG Operations of Arbitrary Primitives with Interval Arithmetic and Real-Time Ray Casting
We apply Knoll et al.'s algorithm [9] to interactively ray-cast constructive solid geometry (CSG) objects of arbitrary primitives represented as implicit functions. Whereas m...
Younis Hijazi, Aaron Knoll, Mathias Schott, Andrew...
NETWORKING
2008
13 years 10 months ago
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Mohammad Behdadfar, Hossein Saidi