1688 search results - page 117 / 338 » The Complexity of Rationalizing Matchings |
143
click to vote
SIGIR
2009
ACM
16 years 8 days ago
2009
ACM
With the increasing importance of search systems on the web, there is a continuing push to design interfaces which are a better match with the kinds of real-world tasks in which u...
192
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: Ontologies such as the Gene Ontology can enable the construction of complex queries over biological information in a conceptual way, however existing systems to do thi...
183
click to vote
WDAG
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
147
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
226
Voted
SIGMOD
2008
ACM
16 years 5 months ago
2008
ACM
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...