Sciweavers

2969 search results - page 462 / 594
» A space efficient algorithm for group structure computation
Sort
View
217
Voted
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
16 years 1 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
AIPS
2004
15 years 7 months ago
Guiding Planner Backjumping Using Verifier Traces
In this paper, we show how a planner can use a modelchecking verifier to guide state space search. In our work on hard real-time, closed-loop planning, we use a modelchecker'...
Robert P. Goldman, Michael J. S. Pelican, David J....
C3S2E
2010
ACM
15 years 7 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
CVGIP
2004
169views more  CVGIP 2004»
15 years 6 months ago
Contour interpolation by straight skeletons
In this paper we present an efficient method for interpolating a piecewise-linear surface between two parallel slices, each consisting of an arbitrary number of (possibly nested) ...
Gill Barequet, Michael T. Goodrich, Aya Levi-Stein...
ICCV
2009
IEEE
16 years 11 months ago
3D reconstruction from image collections with a single known focal length
In this paper we aim at reconstructing 3D scenes from images with unknown focal lengths downloaded from photosharing websites such as Flickr. First we provide a minimal solution...
Martin Bujnak, Zuzana Kukelova, Tomas Pajdla