1920 search results - page 72 / 384 » The Complexity of the A B C Problem |
155
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
166
click to vote
JC
2006
15 years 6 months ago
2006
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
169
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
176
click to vote
RE
2002
Springer
15 years 5 months ago
2002
Springer
Problem frames provide a means of analyzing and decomposing problems. They emphasise the world outside of the computer, helping the developer to focus on the problem domain, inste...
170
Voted
TAMC
2009
Springer
16 years 20 days ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...