2924 search results - page 208 / 585 » Lower Bounds in Distributed Computing |
134
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
TMI
2010
15 years 1 months ago
2010
Abstract—The pinhole camera in single photon emission computed tomography (SPECT) has an inherent trade-off between resolution and sensitivity. Recent systems overcome this to so...
116
click to vote
GD
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
136
click to vote
IACR
2011
14 years 2 months ago
2011
Although malleability is undesirable in traditional digital signatures, schemes with limited malleability properties enable interesting functionalities that may be impossible to o...
115
click to vote
EUROPAR
2001
Springer
15 years 7 months ago
2001
Springer
This paper is on the construction of a server subsystem in a client/server system in an application context where the number of potential clients can be arbitrarily large. The imp...