4759 search results - page 891 / 952 » Parallelizing the Phylogeny Problem |
COCO
2003
Springer
14 years 3 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
EUROSYS
2010
ACM
14 years 4 months ago
2010
ACM
The deluge of huge data sets such as those provided by
sensor networks, online transactions, and the web provide
exciting opportunities for data analysis. The scale of the
data ...
WWW
2005
ACM
14 years 11 months ago
2005
ACM
Experienced web users have strategies for information search and re-access that are not directly supported by web browsers or search engines. We studied how prevalent these strate...
STOC
2009
ACM
14 years 11 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
HPCA
2006
IEEE
14 years 10 months ago
2006
IEEE
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...