Sciweavers

1772 search results - page 13 / 355
» Classifying Problems into Complexity Classes
Sort
View
FSTTCS
2009
Springer
14 years 2 months ago
Domination Problems in Nowhere-Dense Classes
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
Anuj Dawar, Stephan Kreutzer
JMLR
2006
150views more  JMLR 2006»
13 years 7 months ago
Building Support Vector Machines with Reduced Classifier Complexity
Support vector machines (SVMs), though accurate, are not preferred in applications requiring great classification speed, due to the number of support vectors being large. To overc...
S. Sathiya Keerthi, Olivier Chapelle, Dennis DeCos...
PAA
2002
13 years 7 months ago
Hierarchical Fusion of Multiple Classifiers for Hyperspectral Data Analysis
: Many classification problems involve high dimensional inputs and a large number of classes. Multiclassifier fusion approaches to such difficult problems typically centre around s...
Shailesh Kumar, Joydeep Ghosh, Melba M. Crawford
SIAMCOMP
2000
101views more  SIAMCOMP 2000»
13 years 7 months ago
The Complexity of the A B C Problem
-fields are a very general class of difference fields that enable one to discover and prove multisum identities arising in combinatorics and special functions. In this article we f...
Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein
COLING
2000
13 years 9 months ago
Reusing an ontology to generate numeral classifiers
In this paper, we present a solution to the problem of generating Japanese numeral classifiers using semantic classes from an ontology. Most nouns must take a numeral classifier w...
Francis Bond, Kyonghee Paik