523 search results - page 37 / 105 » Improved Approximation Algorithms for Maximum Graph Partitio... |
CGF
2008
13 years 7 months ago
2008
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
BMCBI
2006
13 years 7 months ago
2006
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
FOCS
1997
IEEE
13 years 12 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...