7106 search results - page 61 / 1422 » Restricted Complexity, General Complexity |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We establish a simple generalization of a known result in the plane. The simplices in any pure simplicial complex in Rd may be colored with d+1 colors so that no two simplices tha...
NIPS
2008
13 years 9 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
ESEM
2009
ACM
14 years 2 months ago
2009
ACM
Despite the critical role of software modifiability, it has no universally accepted measurement model. Measuring modifiability in terms of maintenance effort is problematic becaus...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
AAAI
2007
13 years 10 months ago
2007
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...