9532 search results - page 1732 / 1907 » Logic, Graphs, and Algorithms |
135
click to vote
DAC
2005
ACM
16 years 5 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...
137
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...
140
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
140
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
131
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
The power and popularity of kernel methods stem in part from their ability to handle diverse forms of structured inputs, including vectors, graphs and strings. Recently, several m...