4926 search results - page 457 / 986 » Two Graph Algorithms On an Associative Computing Model |
112
Voted
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
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...
131
Voted
DIALM
2008
ACM
15 years 5 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
155
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Image segmentation techniques typically require proper weighting of competing data fidelity and regularization terms. Conventionally, the associated parameters are set t...
177
click to vote
IC
2009
15 years 1 months ago
2009
- Crawling web pages written in Arabic or any other language with limited content in the web may, at first, seem to parallel the process of crawling the English content. However, t...
115
Voted
ISPD
1999
ACM
15 years 8 months ago
1999
ACM
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...