Sciweavers

8825 search results - page 1413 / 1765
» All for one or one for all
Sort
View
RECOMB
2002
Springer
16 years 1 months ago
Comparison of minisatellites
In the class of repeated sequences that occur in DNA, minisatellites have been found polymorphic and became useful tools in genetic mapping and forensic studies. They consist of a...
Eric Rivals, Sèverine Bérard
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 1 months ago
The price of privacy and the limits of LP decoding
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
Cynthia Dwork, Frank McSherry, Kunal Talwar
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
16 years 1 months ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 1 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 1 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
« Prev « First page 1413 / 1765 Last » Next »