Sciweavers

20066 search results - page 3797 / 4014
» T Spaces
Sort
View
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
ADBIS
2001
Springer
107views Database» more  ADBIS 2001»
15 years 10 months ago
The Impact of Buffering on Closest Pairs Queries Using R-Trees
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are...
Antonio Corral, Michael Vassilakopoulos, Yannis Ma...
ALT
2003
Springer
15 years 10 months ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini
CBMS
2001
IEEE
15 years 10 months ago
An Interoperable Data Architecture for Data Exchange in a Biomedical Research Network
Knowledge discovery and data correlation require a unified approach to basic data management. However, achieving such an approach is nearly impossible with hundreds of disparate d...
Daniel J. Crichton, J. Steven Hughes, Gregory J. D...
CAV
2003
Springer
188views Hardware» more  CAV 2003»
15 years 10 months ago
Thread-Modular Abstraction Refinement
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
« Prev « First page 3797 / 4014 Last » Next »