Sciweavers

10146 search results - page 10 / 2030
» Fast FAST
Sort
View
JACM
2002
83views more  JACM 2002»
13 years 8 months ago
Fast context-free grammar parsing requires fast boolean matrix multiplication
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...
Lillian Lee
BMVC
2010
13 years 7 months ago
FAST: Fast Adaptive Silhouette Area based Template Matching
Template matching is a well-proven approach in the area of articulated object tracking. Matching accuracy and computation time of template matching are essential and yet often con...
Daniel Mohr, Gabriel Zachmann