Sciweavers

69 search results - page 11 / 14
» Acceleration Methods for Numeric CSPs
Sort
View
PC
2002
118views Management» more  PC 2002»
13 years 7 months ago
Parallel algorithms for indefinite linear systems
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
Ahmed H. Sameh, Vivek Sarin
AMC
2005
138views more  AMC 2005»
13 years 7 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa
SIAMMAX
2011
157views more  SIAMMAX 2011»
12 years 10 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...
DAGM
2007
Springer
14 years 1 months ago
A Duality Based Approach for Realtime TV-L1 Optical Flow
Variational methods are among the most successful approaches to calculate the optical flow between two image frames. A particularly appealing formulation is based on total variati...
Christopher Zach, Thomas Pock, Horst Bischof
DKE
2002
107views more  DKE 2002»
13 years 7 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias