5100 search results - page 193 / 1020 » The Linear Complexity of a Graph |
PPL
2008
13 years 10 months ago
2008
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linea...
WADS
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
PAMI
2006
13 years 10 months ago
2006
In this paper, we address stereo matching in the presence of a class of non-Lambertian effects, where image formation can be modeled as the additive superposition of layers at diff...
CIE
2008
Springer
14 years 23 days ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
CVIU
2008
13 years 11 months ago
2008
With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in...