Sciweavers

175 search results - page 26 / 35
» A multi-period machine assignment problem
Sort
View
COLT
1993
Springer
15 years 1 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
101
Voted
NIPS
2003
14 years 11 months ago
Max-Margin Markov Networks
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
Benjamin Taskar, Carlos Guestrin, Daphne Koller
CIKM
2007
Springer
15 years 3 months ago
Structure and semantics for expressive text kernels
Several problems in text categorization are too hard to be solved by standard bag-of-words representations. Work in kernel-based learning has approached this problem by (i) consid...
Stephan Bloehdorn, Alessandro Moschitti
COLT
2003
Springer
15 years 2 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
62
Voted
ICML
2009
IEEE
15 years 10 months ago
Multi-assignment clustering for Boolean data
Conventional clustering methods typically assume that each data item belongs to a single cluster. This assumption does not hold in general. In order to overcome this limitation, w...
Andreas P. Streich, Mario Frank, David A. Basin, J...