4491 search results - page 517 / 899 » Algorithm Engineering |
170
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
162
click to vote
EUROSYS
2010
ACM
16 years 3 months ago
2010
ACM
As organizations start to use data-intensive cluster computing systems like Hadoop and Dryad for more applications, there is a growing need to share clusters between users. Howeve...
143
click to vote
CODES
2009
IEEE
16 years 1 months ago
2009
IEEE
– There has been a recent shift in design paradigms, with many turning towards yield-driven approaches to synthesize and design systems. A major cause of this shift is the contin...
181
click to vote
ADMA
2009
Springer
16 years 29 days ago
2009
Springer
The goal of multi-objective clustering (MOC) is to decompose a dataset into similar groups maximizing multiple objectives in parallel. In this paper, we provide a methodology, arch...
165
click to vote
WEBI
2009
Springer
16 years 28 days ago
2009
Springer
We consider the problem of retrieving multiple documents relevant to the single subtopics of a given web query, termed “full-subtopic retrieval”. To solve this problem we pres...