Sciweavers

1631 search results - page 229 / 327
» Uniform Distributed Synthesis
Sort
View
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 9 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
INFOCOM
2007
IEEE
15 years 9 months ago
Queuing Delays in Randomized Load Balanced Networks
—Valiant’s concept of Randomized Load Balancing (RLB), also promoted under the name ‘two-phase routing’, has previously been shown to provide a cost-effective way of implem...
Ravi Prasad, Peter J. Winzer, Sem C. Borst, Marina...
CIVR
2010
Springer
199views Image Analysis» more  CIVR 2010»
15 years 7 months ago
Unsupervised multi-feature tag relevance learning for social image retrieval
Interpreting the relevance of a user-contributed tag with respect to the visual content of an image is an emerging problem in social image retrieval. In the literature this proble...
Xirong Li, Cees G. M. Snoek, Marcel Worring
PROVSEC
2009
Springer
15 years 7 months ago
Oracle Separation in the Non-uniform Model
Abstract. Oracle separation methods are used in cryptography to rule out blackbox reductions between cryptographic primitives. It is sufficient to find an oracle relative to whic...
Ahto Buldas, Sven Laur, Margus Niitsoo
VLDB
1997
ACM
78views Database» more  VLDB 1997»
15 years 7 months ago
Recovering Information from Summary Data
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over speci ed ranges. We study how to estimate the original detail data from the ...
Christos Faloutsos, H. V. Jagadish, Nikolaos Sidir...