Sciweavers

1576 search results - page 300 / 316
» Properties of Synthetic Optimization Problems
Sort
View
TSE
2008
165views more  TSE 2008»
13 years 9 months ago
A Systematic Study of Failure Proximity
Software end users are the best testers, who keep revealing bugs in software that has undergone rigorous in-house testing. In order to leverage their testing efforts, failure repor...
Chao Liu 0001, Xiangyu Zhang, Jiawei Han
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 8 months ago
Is submodularity testable?
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
C. Seshadhri, Jan Vondrák
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 10 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 10 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
DCC
2004
IEEE
14 years 9 months ago
Discrete Universal Filtering Through Incremental Parsing
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinb...