Sciweavers

323 search results - page 23 / 65
» Exact Approximations of omega Numbers
Sort
View
CIE
2005
Springer
14 years 11 months ago
Domain-Theoretic Formulation of Linear Boundary Value Problems
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
Dirk Pattinson
73
Voted
ICIP
2009
IEEE
15 years 10 months ago
Modified Compressive Sensing For Real-time Dynamic Mr Imaging
In this work, we propose algorithms to recursively and causally reconstruct a sequence of natural images from a reduced number of linear projection measurements taken in a domain ...
MP
2002
103views more  MP 2002»
14 years 9 months ago
Detecting Jacobian sparsity patterns by Bayesian probing
In this paper we describe an automatic procedure for successively reducing the set of possible nonzeros in a Jacobian matrix until eventually the exact sparsity pattern is obtained...
Andreas Griewank, Christo Mitev
67
Voted
WWW
2007
ACM
15 years 10 months ago
Using Google distance to weight approximate ontology matches
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
Risto Gligorov, Warner ten Kate, Zharko Aleksovski...
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
14 years 11 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova