Sciweavers

1921 search results - page 139 / 385
» Making AC-3 an Optimal Algorithm
Sort
View
TCS
2008
13 years 10 months ago
A unified approach to finding good stable matchings in the hospitals/residents setting
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
Christine Cheng, Eric McDermid, Ichiro Suzuki
ICDE
2007
IEEE
125views Database» more  ICDE 2007»
14 years 4 months ago
Improved Buffer Size Adaptation through Cache/Controller Coupling
Database workloads seldom remain static. A system tuned by an expert for the current environment, might not always remain optimal. To deal with this situation, database systems ha...
Christian A. Lang, Bishwaranjan Bhattacharjee, Tim...
BMCBI
2010
189views more  BMCBI 2010»
13 years 10 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 10 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 7 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak