736 search results - page 61 / 148 » Distinguishing geometric graphs |
169
click to vote
DCG
2011
14 years 3 months ago
2011
We describe a variant of a method used by modern graphic artists to design what are traditionally called Celtic knots, which are part of a larger family of designs called “mirro...
136
click to vote
CVPR
2004
IEEE
15 years 3 months ago
2004
IEEE
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
103
click to vote
SIAMCOMP
2010
14 years 6 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
125
click to vote
EDBT
2012
ACM
13 years 2 months ago
2012
ACM
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
125
click to vote
DAGSTUHL
2006
15 years 1 months ago
2006
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...