Sciweavers

1201 search results - page 78 / 241
» Linear Probing and Graphs
Sort
View
DAM
2008
102views more  DAM 2008»
15 years 4 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
PAMI
2006
137views more  PAMI 2006»
15 years 4 months ago
Isoperimetric Graph Partitioning for Image Segmentation
Spectral graph partitioning provides a powerful approach to image segmentation. We introduce an alternate idea that finds partitions with a small isoperimetric constant, requiring ...
Leo Grady, Eric L. Schwartz
ICCV
2005
IEEE
16 years 6 months ago
A Graph Cut Algorithm for Generalized Image Deconvolution
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...
Ashish Raj, Ramin Zabih
PPL
2008
94views more  PPL 2008»
15 years 4 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 8 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,...