1458 search results - page 45 / 292 » Monads for incremental computing |
ICPP
2000
IEEE
14 years 3 months ago
2000
IEEE
A runtime parallel incremental DAG scheduling approach is described in this paper. A DAG is expanded incrementally, scheduled, and executed on a parallel machine. A DAG scheduling...
COLING
2010
13 years 6 months ago
2010
Unrehearsed spoken language often contains disfluencies. In order to correctly interpret a spoken utterance, any such disfluencies must be identified and removed or otherwise deal...
ICCSA
2004
Springer
14 years 4 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
ICCV
2009
IEEE
13 years 8 months ago
2009
IEEE
Visual tracking is a challenging problem, as an object may change its appearance due to pose variations, illumination changes, and occlusions. Many algorithms have been proposed t...
COMPGEOM
2003
ACM
14 years 4 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...