289 search results - page 37 / 58 » A Framework for Visualising Large Graphs |
CCCG
2009
15 years 28 days ago
2009
All known examples of generic 3D bar-and-joint frameworks where the distance between a non-edge pair is implied by the edges in the graph contain a rigid vertexinduced subgraph. I...
JGAA
2006
14 years 11 months ago
2006
In this paper we introduce a direct motivation for solving the minimum 2-sum problem, for which we present a linear-time algorithm inspired by the Algebraic Multigrid approach whi...
SIAMDM
2000
14 years 11 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
100
click to vote
PLDI
2009
ACM
15 years 6 months ago
2009
ACM
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
110
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We introduce a novel framework for nonrigid feature
matching among multiple sets in a way that takes into consideration
both the feature descriptor and the features spatial
arra...