Sciweavers

3341 search results - page 255 / 669
» On Bounded Queries and Approximation
Sort
View
CRYPTO
2008
Springer
84views Cryptology» more  CRYPTO 2008»
15 years 8 months ago
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Loka...
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
16 years 8 days ago
Statistical similarity search applied to content-based video copy detection
—Content-based copy detection (CBCD) is one of the emerging multimedia applications for which there is a need of a concerted effort from the database community and the computer ...
Alexis Joly, Olivier Buisson, Carl Frélicot
EDBT
2008
ACM
137views Database» more  EDBT 2008»
16 years 6 months ago
Optimizing away joins on data streams
Abstract. Monitoring aggregates on IP traffic data streams is a compelling application for data stream management systems. Often, such streaming aggregation queries involve joining...
Lukasz Golab, Theodore Johnson, Nick Koudas, Dives...
FOCS
1990
IEEE
15 years 10 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
16 years 1 months ago
On Multi-dimensional Envy-Free Mechanisms
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
Ahuva Mu'alem