Sciweavers

3208 search results - page 226 / 642
» A Lower Bound for Primality
Sort
View
ICALP
2007
Springer
16 years 23 days ago
Model Theory Makes Formulas Large
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole...
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 6 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
COLT
1997
Springer
15 years 10 months ago
Algorithmic Stability and Sanity-Check Bounds for Leave-one-Out Cross-Validation
: In this paper we prove sanity-check bounds for the error of the leave-one-out cross-validation estimate of the generalization error: that is, bounds showing that the worst-case e...
Michael J. Kearns, Dana Ron
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
16 years 6 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
TIT
2011
149views more  TIT 2011»
15 years 1 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...