7129 search results - page 685 / 1426 » Approximation Algorithms for Treewidth |
242
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
221
Voted
COMPGEOM
2008
ACM
15 years 9 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
257
click to vote
TKDE
2012
13 years 9 months ago
2012
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
226
click to vote
CVPR
2003
IEEE
16 years 9 months ago
2003
IEEE
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
189
click to vote
ICIP
2001
IEEE
16 years 9 months ago
2001
IEEE
It is well known that wavelets provide good non-linear approximation of one-dimensional (1-D) piecewise smooth functions. However, it has been shown that the use of a basis with g...