2137 search results - page 139 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
147
Voted
SIBGRAPI
2005
IEEE
15 years 10 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
170
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
138
Voted
SIAMCOMP
2010
14 years 12 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
164
click to vote
CLEIEJ
2010
15 years 2 months ago
2010
A 3D circuit is the stacking of regular 2D circuits. The advances on the fabrication and packaging technologies allowed interconnecting stacked 2D circuits by using 3D vias. Howeve...
154
click to vote
MCS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...