Sciweavers

846 search results - page 110 / 170
» Dependent rounding and its applications to approximation alg...
Sort
View
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 2 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
SIGMOD
2011
ACM
150views Database» more  SIGMOD 2011»
14 years 4 months ago
WHAM: a high-throughput sequence alignment method
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...
Yinan Li, Allison Terrell, Jignesh M. Patel
ICIAP
2005
ACM
16 years 1 months ago
3D Surface Reconstruction from Scattered Data Using Moving Least Square Method
This paper presents an efficient implementation of moving least square(MLS) approximation for 3D surface reconstruction. The smoothness of the MLS is mainly determined by the weigh...
Soon-Jeong Ahn, Jaechil Yoo, Byung-Gook Lee, Joon-...
KDD
2006
ACM
129views Data Mining» more  KDD 2006»
16 years 1 months ago
Bias and controversy: beyond the statistical deviation
In this paper, we investigate how deviation in evaluation activities may reveal bias on the part of reviewers and controversy on the part of evaluated objects. We focus on a `data...
Hady Wirawan Lauw, Ee-Peng Lim, Ke Wang
FORTE
2004
15 years 2 months ago
Localizing Program Errors for Cimple Debugging
Abstract. We present automated techniques for the explanation of counterexamples, where a counter-example should be understood as a sequence of program statements. Our approach is ...
Samik Basu, Diptikalyan Saha, Scott A. Smolka