Sciweavers

2219 search results - page 199 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
ICPR
2002
IEEE
16 years 4 months ago
A Windowed Weighted Approach for Approximate Cyclic String Matching
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
Ramón Alberto Mollineda, Enrique Vidal, Fra...
ICPR
2008
IEEE
15 years 9 months ago
Watershed framework to region-based image segmentation
This paper proposes a new framework to image segmentation which combines edge- and region-based information with spectral techniques through the morphological algorithm of watersh...
Fernando Jorge Coutinho Monteiro, Aurélio C...
JPDC
1998
124views more  JPDC 1998»
15 years 2 months ago
Multilevel k-way Partitioning Scheme for Irregular Graphs
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high ...
George Karypis, Vipin Kumar
VLSISP
2002
112views more  VLSISP 2002»
15 years 2 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
WACV
2012
IEEE
13 years 10 months ago
Dynamic and invisible messaging for visual MIMO
The growing ubiquity of cameras in hand-held devices and the prevalence of electronic displays in signage creates a novel framework for wireless communications. Traditionally, the...
Wenjia Yuan, Kristin J. Dana, Ashwin Ashok, Marco ...