2314 search results - page 361 / 463 » Minimal Partitions of a Graph |
131
Voted
CGO
2003
IEEE
15 years 7 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
148
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predict...
148
Voted
DIALM
2003
ACM
15 years 9 months ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
111
Voted
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
125
click to vote
CVPR
2000
IEEE
16 years 5 months ago
2000
IEEE
In this paper, we present a novel approach to robust skeleton extraction. We use undirected graphs to model connectivity of the skeleton points. The graph topology remains unchang...