523 search results - page 87 / 105 » Improved Approximation Algorithms for Maximum Graph Partitio... |
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
TKDE
2008
13 years 7 months ago
2008
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
STOC
1996
ACM
13 years 11 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...