1940 search results - page 213 / 388 » Optimizing search engines using clickthrough data |
158
Voted
LCTRTS
2007
Springer
16 years 12 days ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
188
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary ...
164
click to vote
CIKM
2009
Springer
16 years 25 days ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
165
click to vote
JSA
2000
15 years 6 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
210
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
Today the major web search engines answer queries by showing ten result snippets, which need to be inspected by users for identifying relevant results. In this paper we investigat...