Sciweavers

3092 search results - page 346 / 619
» Where are you pointing
Sort
View
FSTTCS
2006
Springer
15 years 10 months ago
Computing a Center-Transversal Line
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sel...
3DIM
2003
IEEE
15 years 10 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
COMPGEOM
2005
ACM
15 years 8 months ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
OPODIS
2007
15 years 7 months ago
From an Intermittent Rotating Star to a Leader
Considering an asynchronous system made up of n processes and where up to t of them can crash, finding the weakest assumptions that such a system has to satisfy for a common leade...
Antonio Fernández Anta, Michel Raynal
LFP
1992
140views more  LFP 1992»
15 years 7 months ago
Global Tagging Optimization by Type Inference
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
Fritz Henglein