Sciweavers

2661 search results - page 105 / 533
» Quantum Complexity Classes
Sort
View
GECCO
2004
Springer
15 years 6 months ago
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
Matthew J. Streeter
ICALP
2003
Springer
15 years 6 months ago
Scaled Dimension and Nonuniform Complexity
Resource-bounded dimension is a complexity-theoretic extension of classical Hausdorff dimension introduced by Lutz (2000) in order to investigate the fractal structure of sets th...
John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo
DEXAW
1999
IEEE
109views Database» more  DEXAW 1999»
15 years 5 months ago
Detection of Polygonal Frames in Complex Document Images
A robust method for the localization of frames within document images is presented. It aims at detecting regions delimited by closed polygonal lines or edges in complex color, gra...
Stefano Messelodi, Carla Maria Modena
ALT
1998
Springer
15 years 5 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
CIE
2006
Springer
15 years 4 months ago
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
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...
Johann A. Makowsky