Sciweavers

41 search results - page 5 / 9
» Distributed processing in frames for sparse approximation
Sort
View
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
14 years 7 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
ICRA
2010
IEEE
158views Robotics» more  ICRA 2010»
13 years 6 months ago
Real-time monocular SLAM: Why filter?
Abstract— While the most accurate solution to off-line structure from motion (SFM) problems is undoubtedly to extract as much correspondence information as possible and perform g...
Hauke Strasdat, J. M. M. Montiel, Andrew J. Daviso...
SIAMSC
2011
177views more  SIAMSC 2011»
13 years 2 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
Jie Chen, Mihai Anitescu, Yousef Saad
JMLR
2011
148views more  JMLR 2011»
13 years 2 months ago
Bayesian Generalized Kernel Mixed Models
We propose a fully Bayesian methodology for generalized kernel mixed models (GKMMs), which are extensions of generalized linear mixed models in the feature space induced by a repr...
Zhihua Zhang, Guang Dai, Michael I. Jordan
ISCI
2006
145views more  ISCI 2006»
13 years 7 months ago
Processing count queries over event streams at multiple time granularities
Management and analysis of streaming data has become crucial with its applications in web, sensor data, network traffic data, and stock market. Data streams consist of mostly nume...
Aykut Ünal, Yücel Saygin, Özgü...