2861 search results - page 290 / 573 » Parallel Online Learning |
131
click to vote
CCO
2001
Springer
15 years 7 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
153
click to vote
BMCBI
2006
15 years 2 months ago
2006
Background: Multicategory Support Vector Machines (MC-SVM) are powerful classification systems with excellent performance in a variety of data classification problems. Since the p...
93
Voted
ICANN
2005
Springer
15 years 8 months ago
2005
Springer
Despite the well-known performances and the theoretical power of neural networks, learning and generalizing are sometimes very difficult. In this article, we investigate how short ...
102
Voted
HICSS
2007
IEEE
15 years 6 months ago
2007
IEEE
act Transcript Notation for Analyzing Interactional Construction of Meaning in Online Learning Daniel Suthers, Nathan Dwyer, Ravi Vatrapu, and Richard Medina CL 3 Saturday 1:00
79
Voted
NIPS
2001
15 years 4 months ago
2001
We study the dynamics of a Hebbian ICA algorithm extracting a single non-Gaussian component from a high-dimensional Gaussian background. For both on-line and batch learning we fin...