Sciweavers

2219 search results - page 239 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
ISPDC
2005
IEEE
15 years 9 months ago
A Distributed Prime Sieving Algorithm based on Scheduling by Multiple Edge Reversal
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
Gabriel Paillard, Christian Antoine Louis Lavault,...
ECCV
2006
Springer
16 years 5 months ago
Fast, Quality, Segmentation of Large Volumes - Isoperimetric Distance Trees
For many medical segmentation tasks, the contrast along most of the boundary of the target object is high, allowing simple thresholding or region growing approaches to provide near...
Leo Grady
JSA
2008
124views more  JSA 2008»
15 years 3 months ago
Processor array architectures for flexible approximate string matching
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
Panagiotis D. Michailidis, Konstantinos G. Margari...
ACCV
2010
Springer
14 years 10 months ago
A Unified Approach to Segmentation and Categorization of Dynamic Textures
Dynamic textures (DT) are videos of non-rigid dynamical objects, such as fire and waves, which constantly change their shape and appearance over time. Most of the prior work on DT ...
Avinash Ravichandran, Paolo Favaro, René Vi...
129
Voted
CGO
2008
IEEE
15 years 10 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...