Sciweavers

308 search results - page 37 / 62
» Tight Lower Bounds for the Distinct Elements Problem
Sort
View
73
Voted
TCC
2009
Springer
146views Cryptology» more  TCC 2009»
15 years 10 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
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
15 years 10 months ago
On metric ramsey-type phenomena
The main question studied in this article may be viewed as a nonlinear analogue of Dvoretzky's theorem in Banach space theory or as part of Ramsey theory in combinatorics. Gi...
Yair Bartal, Nathan Linial, Manor Mendel, Assaf Na...
67
Voted
BILDMED
2007
112views Algorithms» more  BILDMED 2007»
14 years 11 months ago
Fully-Automatic Correction of the Erroneous Border Areas of an Aneurysm
Abstract. Volume representations of blood vessels acquired by 3D rotational angiography are very suitable for diagnosing an aneurysm. We presented a fully-automatic aneurysm labell...
Jan Bruijns, Frans J. Peters, Robert-Paul Berretty...
109
Voted
DPD
2010
153views more  DPD 2010»
14 years 7 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
CORR
2007
Springer
82views Education» more  CORR 2007»
14 years 9 months ago
Sorting and Selection with Random Costs
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
Stanislav Angelov, Keshav Kunal, Andrew McGregor