Sciweavers

1702 search results - page 136 / 341
» Using Nondeterminism to Design Efficient Deterministic Algor...
Sort
View
WWW
2008
ACM
14 years 11 months ago
Budget constrained bidding in keyword auctions and online knapsack problems
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Luko...
RECOMB
2003
Springer
14 years 10 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
ALT
1997
Springer
14 years 1 months ago
Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries
A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituti...
Thomas Erlebach, Peter Rossmanith, Hans Stadtherr,...
IPPS
2006
IEEE
14 years 4 months ago
Power-performance efficiency of asymmetric multiprocessors for multi-threaded scientific applications
Recently, under a fixed power budget, asymmetric multiprocessors (AMP) have been proposed to improve the performance of multi-threaded applications compared to symmetric multiproc...
Ryan E. Grant, Ahmad Afsahi
ASPDAC
2001
ACM
103views Hardware» more  ASPDAC 2001»
14 years 1 months ago
Efficient minimum spanning tree construction without Delaunay triangulation
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
Hai Zhou, Narendra V. Shenoy, William Nicholls