112 search results - page 16 / 23 » Improved algorithms for hypergraph bipartitioning |
SIGIR
2008
ACM
13 years 6 months ago
2008
ACM
We present a novel passage-based approach to re-ranking documents in an initially retrieved list so as to improve precision at top ranks. While most work on passage-based document...
SAC
2006
ACM
13 years 6 months ago
2006
ACM
Link farm spam and replicated pages can greatly deteriorate link-based ranking algorithms like HITS. In order to identify and neutralize link farm spam and replicated pages, we lo...
APPROX
2009
Springer
14 years 1 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
ISPD
2005
ACM
14 years 8 days ago
2005
ACM
Placement is a critical component of today's physical synthesis flow with tremendous impact on the final performance of VLSI designs. However, it accounts for a significant p...
ICML
2009
IEEE
14 years 7 months ago
2009
IEEE
Many machine learning algorithms can be formulated as a generalized eigenvalue problem. One major limitation of such formulation is that the generalized eigenvalue problem is comp...