Sciweavers

13500 search results - page 2596 / 2700
» Improved analysis of D
Sort
View
RECOMB
2002
Springer
16 years 6 months ago
Inferring Piecewise Ancestral History from Haploid Sequences
There has been considerable recent interest in the use of haplotype structure to aid in the design and analysis of case-control association studies searching for genetic predictors...
Russell Schwartz, Andrew G. Clark, Sorin Istrail
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
16 years 6 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
16 years 6 months ago
Edge-disjoint paths in Planar graphs with constant congestion
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 6 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
VLDB
2005
ACM
185views Database» more  VLDB 2005»
16 years 6 months ago
Storing and querying XML data using denormalized relational databases
XML database systems emerge as a result of the acceptance of the XML data model. Recent works have followed the promising approach of building XML database management systems on un...
Andrey Balmin, Yannis Papakonstantinou
« Prev « First page 2596 / 2700 Last » Next »