Sciweavers

1772 search results - page 221 / 355
» Classifying Problems into Complexity Classes
Sort
View
TKDE
2002
133views more  TKDE 2002»
15 years 2 months ago
Binary Rule Generation via Hamming Clustering
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expressio...
Marco Muselli, Diego Liberati
WG
2010
Springer
15 years 26 days ago
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov...
TSP
2012
13 years 10 months ago
Optimized Compact-Support Interpolation Kernels
Abstract—In this paper, we investigate the problem of designing compact-support interpolation kernels for a given class of signals. By using calculus of variations, we simplify t...
Ramtin Madani, Ali Ayremlou, Arash Amini, Farrokh ...
IJON
2006
87views more  IJON 2006»
15 years 2 months ago
Translation-invariant classification of non-stationary signals
Non-stationary signal classification is a complex problem. This problem becomes even more difficult if we add the following hypothesis: each signal includes a discriminant wavefor...
Vincent Guigue, Alain Rakotomamonjy, Stépha...
145
Voted
JMLR
2008
168views more  JMLR 2008»
15 years 2 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...