Sciweavers

3251 search results - page 246 / 651
» On a vector q-d algorithm
Sort
View
LWA
2004
15 years 5 months ago
A Simple Method For Estimating Conditional Probabilities For SVMs
Support Vector Machines (SVMs) have become a popular learning algorithm, in particular for large, high-dimensional classification problems. SVMs have been shown to give most accur...
Stefan Rüping
EI
1998
47views more  EI 1998»
15 years 5 months ago
One-dimensional Dithering
A real-time inverse dithering system for video display can be implemented very efficiently if operations are needed on only the current scan line. To optimize overall display qual...
Robert Ulichney
CORR
2010
Springer
76views Education» more  CORR 2010»
15 years 3 months ago
Reconstruction of complete interval tournaments
Let a, b and n be nonnegative integers (b a, b > 0, n 1), Gn(a, b) be a multigraph on n vertices in which any pair of vertices is connected with at least a and at most b edges ...
Antal Iványi
NECO
2008
112views more  NECO 2008»
15 years 3 months ago
Second-Order SMO Improves SVM Online and Active Learning
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
Tobias Glasmachers, Christian Igel
TIT
2008
115views more  TIT 2008»
15 years 3 months ago
Affine Reflection Group Codes
This paper presents a construction of Slepian group codes from affine reflection groups. The solution to the initial vector and nearest distance problem is presented for all irred...
Terasan Niyomsataya, Ali Miri, Monica Nevins