Sciweavers

46 search results - page 5 / 10
» Permutation invariant SVMs
Sort
View
ICIP
2008
IEEE
14 years 9 months ago
LASIC: A model invariant framework for correspondence
In this paper we address two closely related problems. The first is the object detection problem, i.e., the automatic decision of whether a given image represents a known object o...
Bernardo Rodrigues Pires, João Xavier, Jos&...
NIPS
2001
13 years 9 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
ICRA
2006
IEEE
127views Robotics» more  ICRA 2006»
14 years 1 months ago
Controlling three Dimensional Swarms of Robots
— We address the problem of modeling and controlling a swarm of fully actuated point-like robots in three dimensions by generalizing the planar framework from [1]. We define a e...
Nathan Michael, Calin Belta, Vijay Kumar
ICASSP
2011
IEEE
12 years 11 months ago
Generalizations of Blom And Bloem's PDF decomposition for permutation-invariant estimation
Minimum mean squared error estimates generally are not optimal in terms of a common track error statistic used in tracking benchmarks, namely a form of the Mean Optimal Subpattern...
David Frederic Crouse, Peter Willett, Yaakov Bar-S...
IPMI
2005
Springer
14 years 8 months ago
Hypothesis Testing with Nonlinear Shape Models
We present a method for two-sample hypothesis testing for statistical shape analysis using nonlinear shape models. Our approach uses a true multivariate permutation test that is in...
Timothy B. Terriberry, Sarang C. Joshi, Guido Geri...