Sciweavers

1772 search results - page 79 / 355
» Classifying Problems into Complexity Classes
Sort
View
90
Voted
ICDAR
2007
IEEE
15 years 4 months ago
Iterated Document Content Classification
We report an improved methodology for training classifiers for document image content extraction, that is, the location and segmentation of regions containing handwriting, machine...
Chang An, Henry S. Baird, Pingping Xiu
COMPLEXITY
2010
120views more  COMPLEXITY 2010»
14 years 10 months ago
The complexity of partition tasks
In this paper we introduce the Partition Task problem class along with a complexity measure to evaluate its instances and a performance measure to quantify the ability of a system...
Fernando Eesponda, Matías Vera-Cruz, Jorge ...
86
Voted
IANDC
1998
64views more  IANDC 1998»
15 years 7 days ago
Positive Versions of Polynomial Time
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
Clemens Lautemann, Thomas Schwentick, Iain A. Stew...
ICDT
1997
ACM
95views Database» more  ICDT 1997»
15 years 4 months ago
Type-Consistency Problems for Queries in Object-Oriented Databases
Abstract Method invocation mechanism is one of the essential features in objectoriented programming languages. This mechanism contributes to data encapsulation and code reuse, but ...
Yasunori Ishihara, Hiroyuki Seki, Minoru Ito
PODC
2011
ACM
14 years 3 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela