Sciweavers

2283 search results - page 344 / 457
» Bounds of Graph Characteristics
Sort
View
ICIP
2001
IEEE
14 years 9 months ago
Curves vs skeletons in object recognition
The type of representation used in describing shape can have a significant impact on the effectiveness of a recognition strategy. Shape has been represented by its bounding curve ...
Thomas B. Sebastian, Benjamin B. Kimia
ICPR
2002
IEEE
14 years 9 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...
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
14 years 5 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor
WEA
2009
Springer
111views Algorithms» more  WEA 2009»
14 years 2 months ago
A Heuristic for Fair Correlation-Aware Resource Placement
Abstract. The configuration of network resources greatly impacts the communication overhead for data intensive tasks and constitutes a critical problem in the design and maintenan...
Raouf Boutaba, Martin Karsten, Maxwell Young
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
14 years 2 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku