Sciweavers

2843 search results - page 141 / 569
» Interpolation by geometric algorithm
Sort
View
CVPR
2005
IEEE
16 years 5 months ago
A Tensor Decomposition for Geometric Grouping and Segmentation
While spectral clustering has been applied successfully to problems in computer vision, their applicability is limited to pairwise similarity measures that form a probability matr...
Venu Madhav Govindu
CP
2007
Springer
15 years 9 months ago
A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects
: This report introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time co...
Nicolas Beldiceanu, Mats Carlsson, Emmanuel Poder,...
115
Voted
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
15 years 9 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
155
Voted
ANNPR
2006
Springer
15 years 7 months ago
Visual Classification of Images by Learning Geometric Appearances Through Boosting
We present a multiclass classification system for gray value images through boosting. The feature selection is done using the LPBoost algorithm which selects suitable features of a...
Martin Antenreiter, Christian Savu-Krohn, Peter Au...
105
Voted
ALGORITHMICA
2000
80views more  ALGORITHMICA 2000»
15 years 3 months ago
Geometric Eccentricity and the Complexity of Manipulation Plans
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
A. Frank van der Stappen, Kenneth Y. Goldberg