170 search results - page 1 / 34 » Relevance Cuts: Localizing the Search |
CG
1998
Springer
13 years 9 months ago
1998
Springer
Humans can e ectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish ...
ESA
2009
Springer
13 years 11 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
WSDM
2012
ACM
12 years 14 days ago
2012
ACM
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
BMCBI
2011
12 years 8 months ago
2011
Background: A central question in cancer biology is what changes cause a healthy cell to form a tumor. Gene expression data could provide insight into this question, but it is dif...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...