2659 search results - page 408 / 532 » Do we mean the same |
151
click to vote
PODC
2009
ACM
16 years 1 months ago
2009
ACM
The era of parallel computing for the masses is here, but writing correct parallel programs remains far more difficult than writing sequential programs. Aside from a few domains,...
159
click to vote
RWEB
2007
Springer
15 years 10 months ago
2007
Springer
Today customers want to use powerful search engines for their huge and increasing content repositories. Full-text-only products with simple result lists are not enough to satisfy t...
118
click to vote
ISCA
2005
IEEE
15 years 10 months ago
2005
IEEE
As chip densities and clock rates increase, processors are becoming more susceptible to transient faults that can affect program correctness. Up to now, system designers have prim...
139
click to vote
SIGIR
2005
ACM
15 years 10 months ago
2005
ACM
Accurately and effectively detecting the locations where search queries are truly about has huge potential impact on increasing search relevance. In this paper, we define a search...
150
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...