Sciweavers

1977 search results - page 365 / 396
» The satisfactory partition problem
Sort
View
DIS
2007
Springer
15 years 10 months ago
A Hilbert Space Embedding for Distributions
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a reprodu...
Alexander J. Smola, Arthur Gretton, Le Song, Bernh...
IBPRIA
2007
Springer
15 years 10 months ago
Dimensionless Monocular SLAM
Abstract. It has recently been demonstrated that the fundamental computer vision problem of structure from motion with a single camera can be tackled using the sequential, probabil...
Javier Civera, Andrew J. Davison, J. M. M. Montiel
STACS
2007
Springer
15 years 10 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
15 years 10 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
138
Voted
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
15 years 10 months ago
Fast C-obstacle Query Computation for Motion Planning
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...