Sciweavers

1772 search results - page 22 / 355
» Classifying Problems into Complexity Classes
Sort
View
JAIR
2008
99views more  JAIR 2008»
13 years 7 months ago
The Complexity of Planning Problems With Simple Causal Graphs
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
Omer Giménez, Anders Jonsson
DEXA
2008
Springer
130views Database» more  DEXA 2008»
13 years 9 months ago
Classifying Evolving Data Streams Using Dynamic Streaming Random Forests
We consider the problem of data-stream classification, introducing a stream-classification algorithm, Dynamic Streaming Random Forests, that is able to handle evolving data streams...
Hanady Abdulsalam, David B. Skillicorn, Patrick Ma...
ICASSP
2011
IEEE
12 years 11 months ago
Geometric programming for aggregation of binary classifiers
Multiclass classification problems are often decomposed into multiple binary problems that are solved by individual binary classifiers whose results are integrated into a final...
Sunho Park, Seungjin Choi
ICML
2004
IEEE
14 years 8 months ago
A hierarchical method for multi-class support vector machines
We introduce a framework, which we call Divide-by-2 (DB2), for extending support vector machines (SVM) to multi-class problems. DB2 offers an alternative to the standard one-again...
Volkan Vural, Jennifer G. Dy
ICECCS
1997
IEEE
102views Hardware» more  ICECCS 1997»
13 years 12 months ago
Problem complexity
An approach to problem analysis is described, based on the notion of a problem frame. Problem frames are intended to capture classes of recognisable and soluble problems. Because ...
Michael Jackson