499 search results - page 12 / 100 » Multilevel algorithms for linear ordering problems |
DAGSTUHL
2004
13 years 10 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...
JC
2006
13 years 9 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...
SIBGRAPI
2005
IEEE
14 years 2 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
SAC
2009
ACM
14 years 4 months ago
2009
ACM
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
PODC
2010
ACM
14 years 1 months ago
2010
ACM
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...