2487 search results - page 320 / 498 » Partitions of Graphs into Trees |
148
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
125
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
107
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
137
click to vote
ICPP
2008
IEEE
15 years 10 months ago
2008
IEEE
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
133
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...