Sciweavers

6368 search results - page 1032 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
PC
2002
137views Management» more  PC 2002»
15 years 6 months ago
The Chebyshev iteration revisited
Compared to Krylov space methods based on orthogonal or oblique projection, the Chebyshev iteration does not require inner products and is therefore particularly suited for massiv...
Martin H. Gutknecht, Stefan Röllin
TNN
2010
176views Management» more  TNN 2010»
15 years 1 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
IJON
2006
146views more  IJON 2006»
15 years 6 months ago
Feature selection and classification using flexible neural tree
The purpose of this research is to develop effective machine learning or data mining techniques based on flexible neural tree FNT. Based on the pre-defined instruction/operator se...
Yuehui Chen, Ajith Abraham, Bo Yang
EDBT
2006
ACM
179views Database» more  EDBT 2006»
16 years 6 months ago
TrajPattern: Mining Sequential Patterns from Imprecise Trajectories of Mobile Objects
Abstract. Mobile objects have become ubiquitous in our everyday lives, ranging from cellular phones to sensors, therefore, analyzing and mining mobile data becomes an interesting p...
Jiong Yang, Meng Hu
ICIP
2001
IEEE
16 years 8 months ago
Robust estimation of depth and motion using stochastic approximation
The problemof structurefrom motion (SFM)is to extract the three-dimensionalmodel of a moving scene from a sequence of images. Though two images are sufficient to produce a 3D reco...
Rama Chellappa, Amit K. Roy Chowdhury
« Prev « First page 1032 / 1274 Last » Next »