1632 search results - page 169 / 327 » On special numberings of hypergraphs |
170
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
138
click to vote
CHI
2008
ACM
16 years 7 months ago
2008
ACM
User studies are important for many aspects of the design process and involve techniques ranging from informal surveys to rigorous laboratory studies. However, the costs involved ...
139
click to vote
CHI
2003
ACM
16 years 6 months ago
2003
ACM
Motivated by the importance of retrieving comprehensive healthcare information, we analyzed how information about 12 concepts related to a widely available healthcare topic is dis...
168
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
161
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...