Sciweavers

3044 search results - page 129 / 609
» Linear logical approximations
Sort
View
JMLR
2010
136views more  JMLR 2010»
13 years 3 months ago
High Dimensional Inverse Covariance Matrix Estimation via Linear Programming
This paper considers the problem of estimating a high dimensional inverse covariance matrix that can be well approximated by "sparse" matrices. Taking advantage of the c...
Ming Yuan
ICCAD
2005
IEEE
110views Hardware» more  ICCAD 2005»
14 years 6 months ago
A hybrid linear equation solver and its application in quadratic placement
— This paper presents a new hybrid linear equation solver for quadratic placement. The new solver is a combination of stochastic solver and iterative solver: it is proven in this...
Haifeng Qian, Sachin S. Sapatnekar
OL
2011
190views Neural Networks» more  OL 2011»
13 years 4 months ago
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
Pavlo A. Krokhmal
MOC
2010
13 years 3 months ago
hp-Optimal discontinuous Galerkin methods for linear elliptic problems
Abstract. The aim of this paper is to present and analyze a class of hpversion discontinuous Galerkin (DG) discretizations for the numerical approximation of linear elliptic proble...
Benjamin Stamm, Thomas P. Wihler
AMAST
2006
Springer
14 years 23 days ago
Hyperfinite Approximations to Labeled Markov Transition Systems
The problem of finding an approximation to a labeled Markov transition system through hyperfinite transition systems is addressed. It is shown that we can find for each countable ...
Ernst-Erich Doberkat