Sciweavers

824 search results - page 109 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
UAI
2008
13 years 9 months ago
The Phylogenetic Indian Buffet Process: A Non-Exchangeable Nonparametric Prior for Latent Features
Nonparametric Bayesian models are often based on the assumption that the objects being modeled are exchangeable. While appropriate in some applications (e.g., bag-ofwords models f...
Kurt T. Miller, Thomas L. Griffiths, Michael I. Jo...
INFORMS
1998
100views more  INFORMS 1998»
13 years 7 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 8 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
CAD
2006
Springer
13 years 8 months ago
Constrained 3D shape reconstruction using a combination of surface fitting and registration
We investigate 3D shape reconstruction from measurement data in the presence of constraints. The constraints may fix the surface type or set geometric relations between parts of a...
Yang Liu, Helmut Pottmann, Wenping Wang
ICRA
2009
IEEE
121views Robotics» more  ICRA 2009»
14 years 2 months ago
Real-time trajectory generation for car-like vehicles navigating dynamic environments
— This paper presents Tiji, a trajectory generation scheme, ie an algorithm that computes a feasible trajectory between a start and a goal state, for a given robotic system. Tiji...
Vivien Delsart, Thierry Fraichard, Luis Martinez