1772 search results - page 68 / 355 » Classifying Problems into Complexity Classes |
119
Voted
DLT
2008
15 years 1 months ago
2008
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change di...
103
Voted
WINE
2009
Springer
15 years 7 months ago
2009
Springer
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
72
Voted
ICTAC
2005
Springer
15 years 6 months ago
2005
Springer
We present a new derivation of efficient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the speci...
128
Voted
IPM
2002
15 years 6 days ago
2002
This paper proposes a new approach for classifying text documents into two disjoint classes. The new approach is based on extracting patterns, in the form of two logical expressio...
100
Voted
ICDAR
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class ...