44 search results - page 8 / 9 » Clique Partitions, Graph Compression, and Speeding-Up Algori... |
COMBINATORICA
2010
13 years 2 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
FUN
2007
Springer
13 years 11 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We present a multiscale spectral image segmentation algorithm. In contrast to most multiscale image processing, this algorithm works on multiple scales of the image in parallel, w...
CVPR
2007
IEEE
14 years 2 months ago
2007
IEEE
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...