Sciweavers

1651 search results - page 228 / 331
» Measuring the Complexity of Classification Problems
Sort
View
CLEF
2010
Springer
13 years 8 months ago
Random Sampling Image to Class Distance for Photo Annotation
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
Deyuan Zhang, Bingquan Liu, Chengjie Sun, Xiaolong...
APIN
2008
305views more  APIN 2008»
13 years 8 months ago
A generalized model for financial time series representation and prediction
Abstract Traditional financial analysis systems utilize lowlevel price data as their analytical basis. For example, a decision-making system for stock predictions regards raw price...
Depei Bao
CORR
2008
Springer
142views Education» more  CORR 2008»
13 years 8 months ago
A Gaussian Belief Propagation Solver for Large Scale Support Vector Machines
Support vector machines (SVMs) are an extremely successful type of classification and regression algorithms. Building an SVM entails solving a constrained convex quadratic program...
Danny Bickson, Elad Yom-Tov, Danny Dolev
COMPUTING
2006
130views more  COMPUTING 2006»
13 years 8 months ago
Factorized Solution of Lyapunov Equations Based on Hierarchical Matrix Arithmetic
We investigate the numerical solution of large-scale Lyapunov equations with the sign function method. Replacing the usual matrix inversion, addition, and multiplication by format...
Ulrike Baur, Peter Benner
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 8 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan