Sciweavers

1620 search results - page 122 / 324
» Testing Polymorphic Properties
Sort
View
134
Voted
RSA
2006
74views more  RSA 2006»
15 years 5 months ago
Robust locally testable codes and products of codes
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
Eli Ben-Sasson, Madhu Sudan
159
Voted
SIGIR
2002
ACM
15 years 4 months ago
Do TREC web collections look like the web?
We measure the WT10g test collection, used in the TREC-9 and TREC 2001 Web Tracks, and the .GOV test collection used in the TREC 2002 Web and Interactive Tracks, with common measu...
Ian Soboroff
SMC
2010
IEEE
202views Control Systems» more  SMC 2010»
15 years 3 months ago
Evaluating the performance of nonnegative matrix factorization for constructing semantic spaces: Comparison to latent semantic a
—This study examines the ability of nonnegative matrix factorization (NMF) as a method for constructing semantic spaces, in which the meaning of each word is represented by a hig...
Akira Utsumi
123
Voted
SIGSOFT
2010
ACM
15 years 2 months ago
Rethinking the economics of software engineering
Reliance on skilled developers reduces the return on investment for important software engineering tasks such as establishing program correctness. This position paper introduces a...
Todd W. Schiller, Michael D. Ernst
TON
2010
167views more  TON 2010»
14 years 11 months ago
A Machine Learning Approach to TCP Throughput Prediction
TCP throughput prediction is an important capability in wide area overlay and multi-homed networks where multiple paths may exist between data sources and receivers. In this paper...
Mariyam Mirza, Joel Sommers, Paul Barford, Xiaojin...