16666 search results - page 2551 / 3334 » Descriptive and Computational Complexity |
225
click to vote
SPAA
1993
ACM
15 years 11 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
199
click to vote
STACS
1994
Springer
15 years 11 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
216
click to vote
PPSN
1992
Springer
15 years 11 months ago
1992
Springer
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
196
click to vote
SIGGRAPH
1992
ACM
15 years 11 months ago
1992
ACM
We present a new approachto interactive modeling of freeform surfaces. Instead of a fixed mesh of control points, the model presented to the user is that of an infinitely malleabl...
198
click to vote
ACCV
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper, we address the problem of efficient human action detection with only one template. We choose the standard slidingwindow approach to scan the template video...