1671 search results - page 250 / 335 » On the Covering Steiner Problem |
128
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
177
click to vote
IWPEC
2009
Springer
16 years 13 days ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
181
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
199
click to vote
ICCAD
2002
IEEE
16 years 2 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
152
click to vote
ICDM
2009
IEEE
16 years 16 days ago
2009
IEEE
—Methods for learning decision rules are being successfully applied to many problem domains, especially where understanding and interpretation of the learned model is necessary. ...