7129 search results - page 523 / 1426 » Approximation Algorithms for Treewidth |
209
click to vote
IEEECIT
2009
IEEE
16 years 1 months ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
202
click to vote
SSD
2005
Springer
16 years 16 days ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
183
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
224
click to vote
ACIVS
2005
Springer
16 years 19 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...
196
click to vote
LCN
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...