526 search results - page 24 / 106 » Improved Decomposition of STGs |
ANOR
2006
13 years 10 months ago
2006
In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. Our formulation is flexi...
ICIP
2008
IEEE
14 years 4 months ago
2008
IEEE
In this work, we propose the use of sparse signal representation techniques to solve the problem of closed-loop spatial image prediction. The reconstruction of signal in the block...
TACAS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the pro...
PODC
2010
ACM
14 years 1 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
CAIP
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. In this paper we propose a new approach to improve electronic editions of literary corpus, providing an efficient estimation of manuscripts pages structure. In any handwr...