3208 search results - page 64 / 642 » A Lower Bound for Primality |
199
Voted
SODA
2010
ACM
15 years 5 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
174
click to vote
COLT
1993
Springer
15 years 11 months ago
1993
Springer
We consider the problem of learning in multilayer feed-forward networks of linear threshold units. We show that the Vapnik-Chervonenkis dimension of the class of functions that ca...
180
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33n). 2004 Elsevier B.V. All ...
130
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
We attempt to quantify the possible gains that can be achieved by examining a rate-distortion competition between a conventional and a compressive sampling solution to data rate r...
129
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...