743 search results - page 24 / 149 » Solving the Multiple-Instance Problem: A Lazy Learning Appro... |
DAC
2005
ACM
14 years 9 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
ECML
2007
Springer
14 years 3 months ago
2007
Springer
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
SIGIR
2006
ACM
14 years 2 months ago
2006
ACM
Similarity measures for text have historically been an important tool for solving information retrieval problems. In many interesting settings, however, documents are often closel...
JMLR
2012
11 years 11 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
AAAI
2012
11 years 11 months ago
2012
A tailored model of a system is the prerequisite for various analysis tasks, such as anomaly detection, fault identification, or quality assurance. This paper deals with the algo...