Sciweavers

531 search results - page 8 / 107
» A Better Algorithm for Random k-SAT
Sort
View
ESA
2006
Springer
106views Algorithms» more  ESA 2006»
13 years 11 months ago
Less Hashing, Same Performance: Building a Better Bloom Filter
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
Adam Kirsch, Michael Mitzenmacher
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
14 years 1 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
Venkatesan Guruswami, Atri Rudra
ICLP
2009
Springer
14 years 8 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
13 years 9 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire
CVPR
2007
IEEE
14 years 9 months ago
Two thresholds are better than one
The concept of the Bayesian optimal single threshold is a well established and widely used classification technique. In this paper, we prove that when spatial cohesion is assumed ...
Tao Zhang, Terrance E. Boult, R. C. Johnson