Sciweavers

5138 search results - page 333 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
CPC
2006
116views more  CPC 2006»
15 years 6 months ago
Finding Large Independent Sets in Polynomial Expected Time
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
Amin Coja-Oghlan
PTS
2010
134views Hardware» more  PTS 2010»
15 years 5 months ago
A Learning-Based Approach to Unit Testing of Numerical Software
We present an application of learning-based testing to the problem of automated test case generation (ATCG) for numerical software. Our approach uses n-dimensional polynomial model...
Karl Meinke, Fei Niu
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
14 years 6 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 9 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
ICML
2009
IEEE
16 years 7 months ago
Herding dynamical weights to learn
A new "herding" algorithm is proposed which directly converts observed moments into a sequence of pseudo-samples. The pseudosamples respect the moment constraints and ma...
Max Welling