7015 search results - page 71 / 1403 » Approximation algorithms for co-clustering |
WWW
2008
ACM
14 years 9 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
ICDAR
1999
IEEE
14 years 1 months ago
1999
IEEE
Abstract
ALGORITHMICA
2005
13 years 9 months ago
2005
Abstract. We consider the problem of approximating a polygonal curve
SODA
1997
ACM
13 years 10 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
COCOON
2004
Springer
14 years 2 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...