Sciweavers

1068 search results - page 30 / 214
» Fast and robust bootstrap
Sort
View
ICAPR
2009
Springer
14 years 5 months ago
Hierarchical Local Maps for Robust Approximate Nearest Neighbor Computation
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
Pratyush Bhatt, Anoop M. Namboodiri
CGF
2011
13 years 6 months ago
A Survey of Real-Time Hard Shadow Mapping Methods
Due to its versatility, speed and robustness, shadow mapping has always been a popular algorithm for fast hard
Daniel Scherzer, Michael Wimmer, Werner Purgathofe...
CVPR
2008
IEEE
15 years 29 days ago
Accurate and robust registration for in-hand modeling
We present fast 3D surface registration methods for inhand modeling. This allows users to scan complete objects swiftly by simply turning them around in front of the scanner. The ...
Thibaut Weise, Bastian Leibe, Luc J. Van Gool
COORDINATION
2009
Springer
14 years 11 months ago
Hop, a Fast Server for the Diffuse Web
The diffuse Web is an alternative way of using the Web 2.0 infrastructure for building personal diffuse applications. Systems that let users tune the temperature of their house wit...
Manuel Serrano
BMCBI
2007
138views more  BMCBI 2007»
13 years 11 months ago
Fast computation of distance estimators
Background: Some distance methods are among the most commonly used methods for reconstructing phylogenetic trees from sequence data. The input to a distance method is a distance m...
Isaac Elias, Jens Lagergren