219 search results - page 26 / 44 » Optimal dyadic decision trees |
137
Voted
ENTCS
2002
15 years 3 months ago
2002
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
126
Voted
COCOON
2001
Springer
15 years 8 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
139
Voted
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
The co-occurrence pattern, a combination of binary or local features, is more discriminative than individual features and has shown its advantages in object, scene, and action rec...
135
Voted
IPL
2010
15 years 2 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
159
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...