Sciweavers

5115 search results - page 660 / 1023
» On Randomized Lanczos Algorithms
Sort
View
DAIS
2011
14 years 10 months ago
Gozar: NAT-Friendly Peer Sampling with One-Hop Distributed NAT Traversal
Gossip-based peer sampling protocols have been widely used as a building block for many large-scale distributed applications. However, Network Address Translation gateways (NATs) c...
Amir H. Payberah, Jim Dowling, Seif Haridi
CCS
2011
ACM
14 years 6 months ago
PaperSpeckle: microscopic fingerprinting of paper
Paper forgery is among the leading causes of corruption in many developing regions [2]. In this paper, we introduce PaperSpeckle, a robust system that leverages the natural random...
Ashlesh Sharma, Lakshminarayanan Subramanian, Eric...
COLT
2001
Springer
15 years 11 months ago
On Using Extended Statistical Queries to Avoid Membership Queries
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
Nader H. Bshouty, Vitaly Feldman
218
Voted
ICALP
2001
Springer
15 years 11 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
DLOG
2003
15 years 8 months ago
Implementing Matching in ALE--First Results
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
Sebastian Brandt