Sciweavers

5606 search results - page 364 / 1122
» Randomization Techniques for Graphs.
Sort
View
IJWMC
2010
115views more  IJWMC 2010»
15 years 3 months ago
Small-world effects in wireless agent sensor networks
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Kenneth A. Hawick, Heath A. James
CORR
2010
Springer
238views Education» more  CORR 2010»
15 years 6 months ago
Face Identification by SIFT-based Complete Graph Topology
This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully us...
Dakshina Ranjan Kisku, Ajita Rattani, Enrico Gross...
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
15 years 8 months ago
Rapid mixing of Gibbs sampling on graphs that are sparse on average
Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sa...
Elchanan Mossel, Allan Sly
MLQ
1998
126views more  MLQ 1998»
15 years 6 months ago
Reverse Mathematics and Recursive Graph Theory
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theor...
William I. Gasarch, Jeffry L. Hirst
CVPR
2008
IEEE
1042views Computer Vision» more  CVPR 2008»
16 years 8 months ago
Graph cut based image segmentation with connectivity priors
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
Sara Vicente, Vladimir Kolmogorov, Carsten Rother