Sciweavers

860 search results - page 65 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
VLDB
1997
ACM
66views Database» more  VLDB 1997»
13 years 12 months ago
A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...
Khaled Alsabti, Sanjay Ranka, Vineet Singh
FOCS
1998
IEEE
13 years 11 months ago
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...
AAAI
2007
13 years 10 months ago
The Impact of Time on the Accuracy of Sentiment Classifiers Created from a Web Log Corpus
We investigate the impact of time on the predictability of sentiment classification research for models created from web logs. We show that sentiment classifiers are time dependen...
Kathleen T. Durant, Michael D. Smith
TCC
2007
Springer
86views Cryptology» more  TCC 2007»
14 years 1 months ago
Weakly-Private Secret Sharing Schemes
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...
Amos Beimel, Matthew K. Franklin
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
13 years 7 months ago
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
Nikhil Bansal, Kedar Dhamdhere, Jochen Könema...