Sciweavers

97 search results - page 6 / 20
» Graphs of arbitrary excessive class
Sort
View
FOCS
2007
IEEE
15 years 3 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx
ICCV
1999
IEEE
15 years 11 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
ICPR
2008
IEEE
15 years 10 months ago
Nonlocal morphological levelings by partial difference equations over weighted graphs
In this paper, a novel approach to Mathematical Morphology operations is proposed. Morphological operators based on partial differential equations (PDEs) are extended to weighted ...
Vinh-Thong Ta, Abderrahim Elmoataz, Olivier Lezora...
74
Voted
ICASSP
2009
IEEE
15 years 4 months ago
Energy-efficient graph-based wavelets for distributed coding in Wireless Sensor Networks
This work presents a class of unidirectional lifting-based wavelet transforms for an arbitrary communication graph in a wireless sensor network. These transforms are unidirectiona...
Godwin Shen, Sundeep Pattem, Antonio Ortega
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
15 years 10 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald