Sciweavers

1421 search results - page 98 / 285
» Algorithms for subsequence combinatorics
Sort
View
IBPRIA
2005
Springer
15 years 10 months ago
Probabilistic Image-Based Tracking: Improving Particle Filtering
Condensation is a widely-used tracking algorithm based on particle filters. Although some results have been achieved, it has several unpleasant behaviours. In this paper, we highl...
Daniel Rowe, Ignasi Rius, Jordi Gonzàlez, F...
PEPM
1994
ACM
15 years 8 months ago
Identifying Profitable Specialization in Object-Oriented Languages
The performance of object-oriented languages can be greatly improved if methods can be specialized for particular classes of arguments. Such specialization can provide the compile...
Jeffrey Dean, Craig Chambers, David Grove
MPC
1992
Springer
235views Mathematics» more  MPC 1992»
15 years 8 months ago
Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...
Berry Schoenmakers
WSCG
2003
154views more  WSCG 2003»
15 years 5 months ago
Direction Fields over Point-Sampled Geometry
We describe techniques to establish local frames over point-sampled manifold surfaces. The tangential alignment of local frames is determined using a wave front algorithm starting...
Marc Alexa, Tobias Klug, Carsten Stoll
ENTCS
2006
171views more  ENTCS 2006»
15 years 4 months ago
Program Extraction From Proofs of Weak Head Normalization
We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order ...
Malgorzata Biernacka, Olivier Danvy, Kristian St&o...