Sciweavers

4886 search results - page 150 / 978
» Approximate Data Exchange
Sort
View
MICS
2010
137views more  MICS 2010»
15 years 4 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun
SIAMSC
2011
219views more  SIAMSC 2011»
15 years 1 months ago
Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
H. P. Flath, Lucas C. Wilcox, Volkan Akcelik, Judi...
TNN
2010
176views Management» more  TNN 2010»
15 years 24 days 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
GEOINFO
2004
15 years 7 months ago
Approximate Spatial Query Processing using Raster Signatures
: Nowadays, the database characteristics, such as the huge volume of data, the complexity of the queries, and even the data availability, can demand minutes or hours to process a q...
Leonardo Guerreiro Azevedo, Rodrigo Salvador Monte...
144
Voted
ISAAC
2005
Springer
90views Algorithms» more  ISAAC 2005»
15 years 11 months ago
Approximate Colored Range Queries
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
Ying Kit Lai, Chung Keung Poon, Benyun Shi