Sciweavers

2638 search results - page 435 / 528
» Random Geometric Complexes
Sort
View
TCC
2009
Springer
146views Cryptology» more  TCC 2009»
14 years 8 months ago
An Optimally Fair Coin Toss
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
Tal Moran, Moni Naor, Gil Segev
RECOMB
2007
Springer
14 years 8 months ago
GIMscan: A New Statistical Method for Analyzing Whole-Genome Array CGH Data
Genetic instability represents an important type of biological markers for cancer and many other diseases. Array Comparative Genome Hybridization (aCGH) is a high-throughput cytoge...
Yanxin Shi, Fan Guo, Wei Wu, Eric P. Xing
RECOMB
2004
Springer
14 years 8 months ago
Chromosomal breakpoint re-use in the inference of genome sequence rearrangement
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
David Sankoff, Phil Trinh
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
14 years 8 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler
SIGMOD
2007
ACM
170views Database» more  SIGMOD 2007»
14 years 8 months ago
Cardinality estimation using sample views with quality assurance
Accurate cardinality estimation is critically important to high-quality query optimization. It is well known that conventional cardinality estimation based on histograms or simila...
Per-Åke Larson, Wolfgang Lehner, Jingren Zho...