1055 search results - page 58 / 211 » Convex Factorization Machines |
86
Voted
WSC
1998
15 years 1 months ago
1998
Causality constraints of random discrete simulation make parallel and distributed processing difficult. Methods of applying reconfigurable logic to implement and accelerate simula...
SLP
1989
15 years 1 months ago
1989
This paper describes a learning system, LASSY1, which explores domains represented by Prolog databases, and use its acquired knowledge to increase the efficiency of a Prolog inter...
100
Voted
COLT
2000
Springer
15 years 4 months ago
2000
Springer
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
100
click to vote
ECML
2006
Springer
15 years 4 months ago
2006
Springer
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
95
Voted
ML
2007
ACM
15 years 1 days ago
2007
ACM
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...