486 search results - page 37 / 98 » Improved upper bounds for 3-SAT |
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
The Fermat-Weber center of a planar body Q is a point in the plane from which the average distance to the points in Q is minimal. We first show that for any convex body Q in the ...
DAC
2009
ACM
14 years 9 months ago
2009
ACM
Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tol...
APLAS
2009
ACM
14 years 3 months ago
2009
ACM
When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the prog...
COMBINATORICS
1999
13 years 8 months ago
1999
Let G = (V, E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v V , the neighbouring set N(v, C) is the set of vertices of C at d...
NIPS
2004
13 years 10 months ago
2004
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...