2432 search results - page 424 / 487 » Using simple abstraction to reinvent computing for paralleli... |
68
Voted
IWANN
1999
Springer
15 years 1 months ago
1999
Springer
Abstract: Support vector machines (SVMs) are primarily designed for 2-class classification problems. Although in several papers it is mentioned that the combination of K SVMs can b...
106
click to vote
POPL
1993
ACM
15 years 1 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
IPMU
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
91
Voted
NIPS
2001
14 years 11 months ago
2001
Abstract--Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is availab...
104
click to vote
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...