1445 search results - page 99 / 289 » Uniformly Hard Languages |
COLT
2008
Springer
14 years 6 hour ago
2008
Springer
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situat...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
MVA
1998
13 years 11 months ago
1998
1) the density of building is low 2) image resolution is high 3) the color or gray scale for building's surface In this paper, an improved approach of are 'lose to unifo...
ACTA
2007
13 years 10 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
MST
2010
13 years 8 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...