210 search results - page 4 / 42 » Uniform regular enumerations |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time O(mn),...
RSA
2006
13 years 7 months ago
2006
In this note we discuss several combinatorial problems that can be addressed by the Regularity Method for hypergraphs. Based on recent results of Nagle, Schacht and the authors, we...
FCT
2005
Springer
14 years 27 days ago
2005
Springer
EDBTW
2010
Springer
14 years 15 days ago
2010
Springer
ALT
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. This work extends studies of Angluin, Lange and Zeugmann on the dependence of learning on the hypotheses space chosen for the class. In subsequent investigations, uniform...