364 search results - page 34 / 73 » On the generalization of soft margin algorithms |
SIGIR
2003
ACM
14 years 2 months ago
2003
ACM
We present a non-traditional retrieval problem we call subtopic retrieval. The subtopic retrieval problem is concerned with finding documents that cover many different subtopics ...
SDM
2004
SIAM
13 years 10 months ago
2004
SIAM
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
CEC
2007
IEEE
14 years 3 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
CADE
2001
Springer
14 years 9 months ago
2001
Springer
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...