188 search results - page 28 / 38 » A new meta-method for graph partitioning |
IPL
2002
14 years 11 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
103
click to vote
ICIP
2009
IEEE
14 years 9 months ago
2009
IEEE
In this paper, a new unsupervised hierarchical approach to textured color images segmentation is proposed. To this end, we have designed a two-step procedure based on a grey-scale...
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
109
click to vote
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
107
click to vote
PLDI
2006
ACM
15 years 5 months ago
2006
ACM
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...