5316 search results - page 288 / 1064 » Which Search Problems Are Random |
147
click to vote
SIAMCOMP
2008
15 years 5 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
154
click to vote
LCPC
2005
Springer
15 years 10 months ago
2005
Springer
The goal of this work is a systematic approach to compiler optimization for simultaneously optimizing across multiple levels of the memory hierarchy. Our approach combines compiler...
133
click to vote
ECIR
2007
Springer
15 years 6 months ago
2007
Springer
This paper introduces the concept of a Parameterised Search System (PSS), which allows flexibility in user queries, and, more importantly, allows system engineers to easily defin...
185
Voted
WWW
2004
ACM
16 years 5 months ago
2004
ACM
The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business transactions has led to an increase in the deployment of comp...
130
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
A performance and robustness study for on-line signature veri cation is presented. Experiments are carried out on the MCYT database comprising 16,500 signatures from 330 subjects,...