Sciweavers

1105 search results - page 70 / 221
» Linear choosability of graphs
Sort
View
PPL
2008
94views more  PPL 2008»
14 years 12 months ago
Self-Stabilizing Graph Protocols
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...
Wayne Goddard, Stephen T. Hedetniemi, David Pokras...
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
15 years 4 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
PAMI
2006
111views more  PAMI 2006»
14 years 11 months ago
Stereo Matching with Linear Superposition of Layers
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...
Yanghai Tsin, Sing Bing Kang, Richard Szeliski
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
15 years 4 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
CVIU
2008
113views more  CVIU 2008»
14 years 12 months ago
Indexing through laplacian spectra
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...
M. Fatih Demirci, Reinier H. van Leuken, Remco C. ...