Sciweavers

1439 search results - page 103 / 288
» Fast approximation of centrality
Sort
View
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 3 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
IPPS
2002
IEEE
15 years 2 months ago
Fast Inductance Extraction of Large VLSI Circuits
Accurate estimation of signal delay is critical to the design and verification of VLSI circuits. At very high frequencies, signal delay in circuits with small feature sizes is do...
Hemant Mahawar, Vivek Sarin, Weiping Shi
COMPGEOM
2000
ACM
15 years 2 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
INFOCOM
1999
IEEE
15 years 2 months ago
A Fast IP Routing Lookup Scheme for Gigabit Switching Routers
One of the key design issues for the new generation IP routers is the route lookup mechanism. For each incoming IP packet, the IP routing requires to perform a longest prefix match...
Nen-Fu Huang, Shi-Ming Zhao, Jen-Yi Pan, Chi-An Su
KI
1997
Springer
15 years 2 months ago
Fast Grid-Based Position TRacking for Mobile Robots
One of the fundamental problems in the eld of mobile robotics is the estimation of the robot's position in the environment. Position probability grids have been proven to be a...
Wolfram Burgard, Dieter Fox, Daniel Hennig