Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
We consider solutions of a system of refinement equations written in the form φ = α∈Z a(α)φ(2 · −α), where the vector of functions φ = (φ1, . . . , φr)T is in (Lp(R))...
Rong-Qing Jia, Sherman D. Riemenschneider, Ding-Xu...
A workflow consists of a collection of coordinated tasks designed to carry out a welldefined complex process, such as catalog ordering, trip planning, or a business process in an ...
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
With the large and increasing amount of visual information available in digital libraries and the Web, efficient and robust systems for image retrieval are urgently needed. In thi...