886 search results - page 82 / 178 » Reasoning with contextual graphs |
144
click to vote
JGAA
2002
15 years 3 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
162
click to vote
CHARME
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
161
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural gen...
156
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
152
click to vote
ISPA
2007
Springer
15 years 10 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...