Sciweavers

1715 search results - page 203 / 343
» Point Sample Rendering
Sort
View
3DIM
2001
IEEE
15 years 7 months ago
Efficient Variants of the ICP Algorithm
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. Many variant...
Szymon Rusinkiewicz, Marc Levoy
ESA
2008
Springer
136views Algorithms» more  ESA 2008»
15 years 5 months ago
Oblivious Randomized Direct Search for Real-Parameter Optimization
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
Jens Jägersküpper
SDM
2008
SIAM
144views Data Mining» more  SDM 2008»
15 years 5 months ago
Active Learning with Model Selection in Linear Regression
Optimally designing the location of training input points (active learning) and choosing the best model (model selection) are two important components of supervised learning and h...
Masashi Sugiyama, Neil Rubens
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 5 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
CSDA
2006
84views more  CSDA 2006»
15 years 4 months ago
Robust weighted LAD regression
The least squares linear regression estimator is well-known to be highly sensitive to unusual observations in the data, and as a result many more robust estimators have been propo...
Avi Giloni, Jeffrey S. Simonoff, Bhaskar Sengupta