Sciweavers

1594 search results - page 44 / 319
» Fast Prediction on a Tree
Sort
View
MTPP
2010
13 years 5 months ago
A Fast General Parser for Automatic Code Generation
Abstract. The code generator in a compiler attempts to match a subject tree against a collection of tree-shaped patterns for generating instructions. Tree-pattern matching may be c...
Wuu Yang
WISE
2009
Springer
14 years 2 months ago
STC+ and NM-STC: Two Novel Online Results Clustering Methods for Web Searching
Results clustering in Web Searching is useful for providing users with overviews of the results and thus allowing them to restrict their focus to the desired parts. However, the ta...
Stella Kopidaki, Panagiotis Papadakos, Yannis Tzit...
SI3D
2012
ACM
12 years 3 months ago
Fast, effective BVH updates for animated scenes
Bounding volume hierarchies (BVHs) are a popular acceleration structure choice for animated scenes rendered with ray tracing. This is due to the relative simplicity of refitting ...
Daniel Kopta, Thiago Ize, Josef B. Spjut, Erik Bru...
LATIN
2010
Springer
14 years 2 months ago
Layered Working-Set Trees
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
ICRA
2009
IEEE
137views Robotics» more  ICRA 2009»
14 years 2 months ago
An optimized Linear Model Predictive Control solver for online walking motion generation
— This article addresses the fast solution of a Quadratic Program underlying a Linear Model Predictive Control scheme that generates walking motions. We introduce an algorithm wh...
Dimitar Dimitrov, Pierre-Brice Wieber, Olivier Sta...