6004 search results - page 312 / 1201 » Parallelizing query optimization |
122
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Dealing with verbose (or long) queries poses a new challenge for information retrieval. Selecting a subset of the original query (a "sub-query") has been shown to be an ...
150
Voted
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
122
click to vote
CW
2005
IEEE
15 years 6 months ago
2005
IEEE
XML information retrieval (XML-IR) systems aim to provide users with highly exhaustive and highly specific results. To interact with XML-IR systems, users must express both their ...
133
click to vote
SIGMETRICS
2011
ACM
14 years 3 months ago
2011
ACM
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
120
click to vote
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...