Sciweavers

1421 search results - page 99 / 285
» Algorithms for subsequence combinatorics
Sort
View
CVPR
2008
IEEE
16 years 6 months ago
Increasing the density of Active Appearance Models
Active Appearance Models (AAMs) typically only use 50-100 mesh vertices because they are usually constructed from a set of training images with the vertices hand-labeled on them. ...
Krishnan Ramnath, Simon Baker, Iain Matthews, Deva...
SPIN
2009
Springer
15 years 11 months ago
Improving Non-Progress Cycle Checks
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
David Faragó, Peter H. Schmitt
ASIACRYPT
2000
Springer
15 years 8 months ago
A Note on Security Proofs in the Generic Model
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
Marc Fischlin
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
15 years 2 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo
COCOON
2009
Springer
15 years 11 months ago
On the Performances of Nash Equilibria in Isolation Games
: Network games play a fundamental role in understanding behavior in many domains, ranging from communication networks through markets to social networks. Such networks are used, a...
Vittorio Bilò, Michele Flammini, Gianpiero ...