112 search results - page 13 / 23 » Improved algorithms for hypergraph bipartitioning |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
JCT
1998
13 years 6 months ago
1998
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
SIGIR
2006
ACM
14 years 20 days ago
2006
ACM
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...
ISAAC
2005
Springer
14 years 6 days ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
DASFAA
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract. Warehousing heterogeneous, dynamic biological data is a key technique for biological data integration as it greatly improves performance. However, it requires complex mai...