Sciweavers

220 search results - page 17 / 44
» A Pseudo-Metric for Weighted Point Sets
Sort
View
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
11 years 11 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
CLASSIFICATION
2006
103views more  CLASSIFICATION 2006»
13 years 8 months ago
On the Complexity of Ordinal Clustering
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
Rahul Shah, Martin Farach-Colton
ML
2002
ACM
141views Machine Learning» more  ML 2002»
13 years 8 months ago
On the Existence of Linear Weak Learners and Applications to Boosting
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
Shie Mannor, Ron Meir
WSCG
2004
155views more  WSCG 2004»
13 years 9 months ago
NURBS Fairing by Knot Vector Optimization
The shape of a NURBS curve or patch is defined by the location of its control points, the weights associated with these points, and the parameter intervals, also called the knot v...
Barnabás Aszódi, Szabolcs Czuczor, L...
PAMI
2002
201views more  PAMI 2002»
13 years 8 months ago
ICP Registration Using Invariant Features
This paper investigates the use of Euclidean invariant features in a generalization of iterative closest point registration of range images. Pointwisecorrespondences are chosen as...
Gregory C. Sharp, Sang Wook Lee, David K. Wehe