4843 search results - page 164 / 969 » The Shortcut Problem - Complexity and Approximation |
106
click to vote
STACS
1990
Springer
15 years 7 months ago
1990
Springer
We consider the problem of approximating a convex gure in the plane by a pair (r; R) of homothetic (that is, similar and parallel) rectangles with r C R. We show the existenc...
112
click to vote
PPSC
1993
15 years 4 months ago
1993
We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...
105
Voted
IPL
2008
15 years 3 months ago
2008
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
155
click to vote
ML
2008
ACM
15 years 2 months ago
2008
ACM
In this paper we present the system ALLPAD for learning Logic Programs with Annotated Disjunctions (LPADs). ALLPAD modifies the previous system LLPAD in order to tackle real world ...
146
Voted
WABI
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...