529 search results - page 92 / 106 » Improving verbose queries using subset distribution |
COLT
2007
Springer
15 years 5 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
106
click to vote
CIKM
2005
Springer
15 years 5 months ago
2005
Springer
Depending on a web searcher’s familiarity with a query’s target topic, it may be more appropriate to show her introductory or advanced documents. The TREC HARD [1] track defi...
116
click to vote
OOPSLA
2005
Springer
15 years 5 months ago
2005
Springer
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
PAM
2004
Springer
15 years 5 months ago
2004
Springer
Given that the global DNS system, especially at the higher root and top-levels, experiences significant query loads, we seek to answer the following questions: (1) How does the ch...
111
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...