Sciweavers

1199 search results - page 125 / 240
» Parameterized Proof Complexity
Sort
View
CP
2006
Springer
14 years 1 months ago
Constraint Satisfaction with Bounded Treewidth Revisited
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
Marko Samer, Stefan Szeider
CGA
1998
13 years 9 months ago
Verbs and Adverbs: Multidimensional Motion Interpolation
This paper describes methods and data structures used to leverage motion sequences of complex linked figures. We present a technique for interpolating between example motions der...
Charles Rose, Michael F. Cohen, Bobby Bodenheimer
CVPR
2005
IEEE
15 years 2 days ago
Object Recognition with Features Inspired by Visual Cortex
We introduce a novel set of features for robust object recognition. Each element of this set is a complex feature obtained by combining position- and scale-tolerant edgedetectors ...
Thomas Serre, Lior Wolf, Tomaso Poggio
ICFP
2008
ACM
14 years 10 months ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss
STOC
2009
ACM
118views Algorithms» more  STOC 2009»
14 years 4 months ago
How long does it take to catch a wild kangaroo?
The discrete logarithm problem asks to solve for the exponent x, given the generator g of a cyclic group G and an element h ∈ G such that gx = h. We give the first rigorous pro...
Ravi Montenegro, Prasad Tetali