Sciweavers

242 search results - page 25 / 49
» Approximate substring selectivity estimation
Sort
View
SIGIR
1999
ACM
13 years 11 months ago
Comparing the Performance of Database Selection Algorithms
Abstract We compare the performance of two database selection algorithms reported in the literature. Their performance is compared using a common testbed designed specifically for ...
James C. French, Allison L. Powell, James P. Calla...
WSC
2004
13 years 8 months ago
A Large Deviations Perspective on Ordinal Optimization
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...
Peter W. Glynn, Sandeep Juneja
TIFS
2008
194views more  TIFS 2008»
13 years 7 months ago
Detection of Double-Compression in JPEG Images for Applications in Steganography
This paper presents a method for detection of double JPEG compression and a maximum likelihood estimator of the primary quality factor. These methods are essential for construction...
Tomás Pevný, Jessica J. Fridrich
SIGMOD
1994
ACM
91views Database» more  SIGMOD 1994»
13 years 11 months ago
Estimating Page Fetches for Index Scans with Finite LRU Buffers
We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches ...
Arun N. Swami, K. Bernhard Schiefer
NN
2000
Springer
165views Neural Networks» more  NN 2000»
13 years 7 months ago
Construction of confidence intervals for neural networks based on least squares estimation
We present the theoretical results about the construction of confidence intervals for a nonlinear regression based on least squares estimation and using the linear Taylor expansio...
Isabelle Rivals, Léon Personnaz