Sciweavers

2750 search results - page 283 / 550
» The complexity of learning SUBSEQ(A)
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Efficient inference on sequence segmentation models
Sequence segmentation is a flexible and highly accurate mechanism for modeling several applications. Inference on segmentation models involves dynamic programming computations tha...
Sunita Sarawagi
ICML
2006
IEEE
16 years 7 months ago
Statistical debugging: simultaneous identification of multiple bugs
We describe a statistical approach to software debugging in the presence of multiple bugs. Due to sparse sampling issues and complex interaction between program predicates, many g...
Alice X. Zheng, Michael I. Jordan, Ben Liblit, May...
ICML
2005
IEEE
16 years 7 months ago
Weighted decomposition kernels
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
Sauro Menchetti, Fabrizio Costa, Paolo Frasconi
ICML
2005
IEEE
16 years 7 months ago
An efficient method for simplifying support vector machines
In this paper we describe a new method to reduce the complexity of support vector machines by reducing the number of necessary support vectors included in their solutions. The red...
DucDung Nguyen, Tu Bao Ho
ICML
2004
IEEE
16 years 7 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