Sciweavers

7519 search results - page 1251 / 1504
» Optimizing Generic Functions
Sort
View
RECOMB
2004
Springer
16 years 6 months ago
Aligning alignments exactly
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Dean Starrett
RECOMB
2003
Springer
16 years 6 months ago
Designing seeds for similarity search in genomic DNA
Large-scale comparison of genomic DNA is of fundamental importance in annotating functional elements of genomes. To perform large comparisons efficiently, BLAST (Methods: Companio...
Jeremy Buhler, Uri Keich, Yanni Sun
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 6 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 6 months ago
Keyword search on structured and semi-structured data
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
Yi Chen, Wei Wang 0011, Ziyang Liu, Xuemin Lin
SIGMOD
2004
ACM
166views Database» more  SIGMOD 2004»
16 years 6 months ago
Fast Computation of Database Operations using Graphics Processors
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
Naga K. Govindaraju, Brandon Lloyd, Wei Wang 0010,...
« Prev « First page 1251 / 1504 Last » Next »