Sciweavers

1913 search results - page 171 / 383
» Group Input Machine
Sort
View
FOCS
1997
IEEE
15 years 8 months ago
Computable Obstructions to Wait-free Computability
Abstract. We show how to associate e ectively computableobstructions to a waitfree distributed decision task (I;O; ) in the asynchronous shared-memory, readwrite model. The key new...
John Havlicek
ISMB
2007
15 years 6 months ago
Automatic genome-wide reconstruction of phylogenetic gene trees
Gene duplication and divergence is a major evolutionary force. Despite the growing number of fully sequenced genomes, methods for investigating these events on a genome-wide scale...
Ilan Wapinski, Avi Pfeffer, Nir Friedman, Aviv Reg...
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
15 years 6 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova
CIDR
2007
165views Algorithms» more  CIDR 2007»
15 years 5 months ago
A Black-Box Approach to Query Cardinality Estimation
We present a “black-box” approach to estimating query cardinality that has no knowledge of query execution plans and data distribution, yet provides accurate estimates. It doe...
Tanu Malik, Randal C. Burns, Nitesh V. Chawla
ALIFE
2004
15 years 4 months ago
Using Avida to Test the Effects of Natural Selection on Phylogenetic Reconstruction Methods
Phylogenetic trees group organisms by their ancestral relationships. There are a number of distinct algorithms used to reconstruct these trees from molecular sequence data, but dif...
George I. Hagstrom, Dehua H. Hang, Charles Ofria, ...