Sciweavers

347 search results - page 48 / 70
» The Berlekamp-Massey Algorithm revisited
Sort
View
DAGM
2006
Springer
15 years 2 months ago
Shape Matching by Variational Computation of Geodesics on a Manifold
Abstract. Klassen et al. [9] recently developed a theoretical formulation to model shape dissimilarities by means of geodesics on appropriate spaces. They used the local geometry o...
Frank R. Schmidt, Michael Clausen, Daniel Cremers
116
Voted
CCGRID
2008
IEEE
15 years 27 days ago
Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
Sascha Hunold, Thomas Rauber, Frédér...
ICCV
2009
IEEE
16 years 3 months ago
Structure- and Motion-adaptive Regularization for High Accuracy Optic Flow
The accurate estimation of motion in image sequences is of central importance to numerous computer vision applications. Most competitive algorithms compute flow fields by minimi...
Andreas Wedel, Daniel Cremers, Thomas Pock, Horst ...
55
Voted
ICMCS
2007
IEEE
134views Multimedia» more  ICMCS 2007»
15 years 5 months ago
Cryptanalysis of a Video Scrambling Based on Space Filling Curves
In this paper, we study the security of an image scrambling algorithm based on Space-Filling Curves (SFC). A random SFC is a pixel permutation that changes the scanning order with...
Ayoub Massoudi, Frédéric Lefè...
93
Voted
AAIM
2007
Springer
118views Algorithms» more  AAIM 2007»
15 years 2 months ago
Significance-Driven Graph Clustering
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale b...
Marco Gaertler, Robert Görke, Dorothea Wagner