6575 search results - page 395 / 1315 » Specializing visualization algorithms |
167
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
286
click to vote
ISCA
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
157
click to vote
ORL
1998
15 years 6 months ago
1998
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
236
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—Social networks exhibit a very special property: community structure. Understanding the network community structure is of great advantages. It not only provides helpful informat...
215
click to vote
ACIVS
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. In this paper we present a new implementation of a rainfalling watershed segmentation algorithm. Our previous algorithm was a one-run algorithm. All the steps needed to c...