113 search results - page 18 / 23 » Rigid Components of Random Graphs |
JSAT
2008
13 years 6 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
GRC
2010
IEEE
13 years 6 months ago
2010
IEEE
—Images with GPS coordinates are a rich source of information about a geographic location. Innovative user services and applications are being built using geotagged images taken ...
RANDOM
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
CVPR
2011
IEEE
12 years 10 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
CVPR
2012
IEEE
11 years 9 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...