Sciweavers

6110 search results - page 345 / 1222
» Approximate Computing
Sort
View
DCG
2008
93views more  DCG 2008»
15 years 6 months ago
Robust Shape Fitting via Peeling and Grating Coresets
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
JMLR
2010
192views more  JMLR 2010»
15 years 1 months ago
Efficient Learning of Deep Boltzmann Machines
We present a new approximate inference algorithm for Deep Boltzmann Machines (DBM's), a generative model with many layers of hidden variables. The algorithm learns a separate...
Ruslan Salakhutdinov, Hugo Larochelle
SIAMMAX
2011
157views more  SIAMMAX 2011»
14 years 9 months ago
Deflated Restarting for Matrix Functions
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
Michael Eiermann, Oliver G. Ernst, Stefan Güt...
JSC
2006
147views more  JSC 2006»
15 years 6 months ago
An algorithm to solve integer linear systems exactly using numerical methods
In this paper, we present a new algorithm for the exact solutions of linear systems with integer coefficients using numerical methods. It terminates with the correct answer in wel...
Zhendong Wan
HYBRID
2010
Springer
16 years 1 months ago
Accurate hybridization of nonlinear systems
This paper is concerned with reachable set computation for non-linear systems using hybridization. The essence of hybridization is to approximate a non-linear vector field by a s...
Thao Dang, Oded Maler, Romain Testylier