Sciweavers

6004 search results - page 671 / 1201
» Parallelizing query optimization
Sort
View
FOCS
2009
IEEE
15 years 8 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
SIGMOD
2011
ACM
250views Database» more  SIGMOD 2011»
14 years 7 months ago
Hybrid in-database inference for declarative information extraction
In the database community, work on information extraction (IE) has centered on two themes: how to effectively manage IE tasks, and how to manage the uncertainties that arise in th...
Daisy Zhe Wang, Michael J. Franklin, Minos N. Garo...
CGO
2010
IEEE
15 years 11 months ago
Parameterized tiling revisited
Tiling, a key transformation for optimizing programs, has been widely studied in literature. Parameterized tiled code is important for auto-tuning systems since they often execute...
Muthu Manikandan Baskaran, Albert Hartono, Sanket ...
IPPS
2009
IEEE
15 years 11 months ago
Evaluating the use of GPUs in liver image segmentation and HMMER database searches
In this paper we present the results of parallelizing two life sciences applications, Markov random fieldsbased (MRF) liver segmentation and HMMER’s Viterbi algorithm, using GP...
John Paul Walters, Vidyananth Balu, Suryaprakash K...
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
15 years 11 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...