59 search results - page 12 / 12 » The volume algorithm revisited: relation with bundle methods |
184
click to vote
POPL
2006
ACM
16 years 1 hour ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
BMCBI
2008
14 years 11 months ago
2008
Background: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA ...
113
click to vote
WWW
2011
ACM
14 years 6 months ago
2011
ACM
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...
CIKM
2011
Springer
13 years 11 months ago
2011
Springer
Traditionally, search engines have ignored the reading difficulty of documents and the reading proficiency of users in computing a document ranking. This is one reason why Web se...