Sciweavers

2254 search results - page 271 / 451
» Computing the minimal covering set
Sort
View
ICRA
2010
IEEE
147views Robotics» more  ICRA 2010»
15 years 5 months ago
Learning physically-instantiated game play through visual observation
Abstract— We present an integrated vision and robotic system that plays, and learns to play, simple physically-instantiated board games that are variants of TIC TAC TOE and HEXAP...
Andrei Barbu, Siddharth Narayanaswamy, Jeffrey Mar...
GD
2009
Springer
15 years 11 months ago
Geometric Simultaneous Embeddings of a Graph and a Matching
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
Sergio Cabello, Marc J. van Kreveld, Giuseppe Liot...
DAC
2005
ACM
15 years 8 months ago
Faster and better global placement by a new transportation algorithm
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the t...
Ulrich Brenner, Markus Struzyna
CVPR
2008
IEEE
15 years 8 months ago
Loose shape model for discriminative learning of object categories
We consider the problem of visual categorization with minimal supervision during training. We propose a partbased model that loosely captures structural information. We represent ...
Margarita Osadchy, Elran Morash
ECCV
2006
Springer
16 years 8 months ago
Triangulation for Points on Lines
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
Adrien Bartoli, Jean-Thierry Lapresté