Sciweavers

10602 search results - page 1950 / 2121
» Weakly Useful Sequences
Sort
View
250
Voted
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 11 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
203
Voted
MITJSME
1989
15 years 11 months ago
Cooperation in Aircraft Design
We describe how aircraft are designed in a large organization. We discuss the different phases of design and interaction with the customer. We then describe the models used by each...
Alan H. Bond, Richard J. Ricci
273
Voted
AGTIVE
2007
Springer
15 years 11 months ago
Transforming Timeline Specifications into Automata for Runtime Monitoring
Abstract. In runtime monitoring, a programmer specifies code to execute whenever a sequence of events occurs during program execution. Previous and related work has shown that runt...
Eric Bodden, Hans Vangheluwe
205
Voted
DAGM
2009
Springer
15 years 11 months ago
An Efficient Linear Method for the Estimation of Ego-Motion from Optical Flow
Abstract. Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of...
Florian Raudies, Heiko Neumann
178
Voted
GRAPHITE
2007
ACM
15 years 11 months ago
Compact and efficient generation of radiance transfer for dynamically articulated characters
We present a data-driven technique for generating the precomputed radiance transfer vectors of an animated character as a function of its joint angles. We learn a linear model for...
Derek Nowrouzezahrai, Patricio D. Simari, Evangelo...
« Prev « First page 1950 / 2121 Last » Next »