Sciweavers

1772 search results - page 4 / 355
» Classifying Problems into Complexity Classes
Sort
View
ICDCS
2010
IEEE
13 years 7 months ago
Complexity Analysis of Weak Multitolerance
—In this paper, we classify multitolerant systems, i.e., systems that tolerate multiple classes of faults and provide potentially different levels of tolerance to them in terms o...
Jingshu Chen, Sandeep Kulkarni
IJCAI
2007
13 years 9 months ago
Locating Complex Named Entities in Web Text
Named Entity Recognition (NER) is the task of locating and classifying names in text. In previous work, NER was limited to a small number of predefined entity classes (e.g., peop...
Doug Downey, Matthew Broadhead, Oren Etzioni
DAM
1999
81views more  DAM 1999»
13 years 7 months ago
On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs
We survey results on the sequential and parallel complexity of hamiltonian path and cycle problems in various classes of digraphs which generalize tournaments. We give detailed in...
Jørgen Bang-Jensen, Gregory Gutin
LICS
2002
IEEE
14 years 16 days ago
Complete Problems for Dynamic Complexity Classes
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC ¢ , the dynamic classes corresponding to relational calculus and (...
William Hesse, Neil Immerman
LATA
2010
Springer
14 years 5 months ago
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...