Sciweavers

Share
5 search results - page 1 / 1
» Fitting a two-joint orthogonal chain to a point set
Sort
View
COMGEO
2011
ACM
8 years 8 months ago
Fitting a two-joint orthogonal chain to a point set
José Miguel Díaz-Báñez...
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
9 years 8 months ago
Untangled Monotonic Chains and Adaptive Range Search
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, ...
IVC
2008
117views more  IVC 2008»
9 years 1 months ago
Direct type-specific conic fitting and eigenvalue bias correction
A new method to fit specific types of conics to scattered data points is introduced. Direct, specific fitting of ellipses and hyperbolae is achieved by imposing a quadratic constr...
Matthew Harker, Paul O'Leary, Paul J. Zsombor-Murr...
CVPR
2008
IEEE
10 years 3 months ago
Spectral methods for semi-supervised manifold learning
Given a finite number of data points sampled from a low-dimensional manifold embedded in a high dimensional space together with the parameter vectors for a subset of the data poin...
Zhenyue Zhang, Hongyuan Zha, Min Zhang
SADM
2010
196views more  SADM 2010»
8 years 8 months ago
Bayesian adaptive nearest neighbor
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
Ruixin Guo, Sounak Chakraborty
books