942 search results - page 56 / 189 » Constraints in Graph Drawing Algorithms |
101
click to vote
DAGM
2004
Springer
15 years 8 months ago
2004
Springer
A fundamental problem in image recognition is to evaluate the similarity of two images. This can be done by searching for the best pixel-to-pixel matching taking into account suita...
115
click to vote
EURODAC
1994
IEEE
15 years 6 months ago
1994
IEEE
The use of a realistic component library with multiple implementations of operators, results in cost ef cient designs; slow components can then be used on non-critical paths and t...
116
Voted
DATE
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
103
click to vote
GRAPHICSINTERFACE
2009
15 years 11 days ago
2009
Sketch recognition is the automated recognition of hand-drawn diagrams. When allowing users to sketch as they would naturally, users may draw shapes in an interspersed manner, sta...
113
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...