3019 search results - page 502 / 604 » Approximating the Domatic Number |
206
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
195
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has m...
175
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
153
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...
158
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a ...