Sciweavers

2570 search results - page 189 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
151
Voted
JAIR
2006
179views more  JAIR 2006»
15 years 3 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
100
Voted
ICPR
2008
IEEE
16 years 4 months ago
Fast protein homology and fold detection with sparse spatial sample kernels
In this work we present a new string similarity feature, the sparse spatial sample (SSS). An SSS is a set of short substrings at specific spatial displacements contained in the or...
Pai-Hsi Huang, Pavel P. Kuksa, Vladimir Pavlovic
118
Voted
ICPR
2000
IEEE
16 years 4 months ago
Constructing Finite State Machines for Fast Gesture Recognition
This paper proposes an approach to 2D gesture recognition that models each gesture as a Finite State Machine (FSM) in spatial-temporal space. The model construction works in a sem...
Pengyu Hong, Thomas S. Huang, Matthew Turk
DAC
2002
ACM
16 years 4 months ago
A fast optical propagation technique for modeling micro-optical systems
As designers become more aggressive in introducing optical components to micro-systems, rigorous optical models are required for system-level simulation tools. Common optical mode...
Timothy P. Kurzweg, Steven P. Levitan, Jose A. Mar...
FOCS
2000
IEEE
15 years 8 months ago
Fast parallel circuits for the quantum Fourier transform
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
Richard Cleve, John Watrous