Sciweavers

63 search results - page 3 / 13
» Remarks on the second neighborhood problem
Sort
View
ICIP
2009
IEEE
14 years 8 months ago
Discrete Curvature Calculation For Fast Level Set Segmentation
Fast level set methods replace continuous PDEs by a discrete formulation, improving the execution times. The regularization in fast level set methods was so far handled indirectly...
INFOCOM
2007
IEEE
14 years 1 months ago
Low-Complexity Distributed Scheduling Algorithms for Wireless Networks
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
Abhinav Gupta, Xiaojun Lin, R. Srikant
ICIP
2009
IEEE
14 years 8 months ago
Segmentation On Surfaces With The Closest Point Method
We propose a method to detect objects and patterns in textures on general surfaces. Our approach applies the Chan?Vese variational model for active contours without edges to the p...
ICCV
2007
IEEE
14 years 9 months ago
Optimization Algorithms for Labeling Brain Sulci Based on Graph Matching
Graph matching techniques are widely used in pattern recognition problems such as scene description, finger print identification, or face recognition. In this paper, we put forwar...
Faguo Yang, Frithjof Kruggel
AISB
1994
Springer
13 years 11 months ago
An Empirical Comparison of Selection Methods in Evolutionary Algorithms
Selection methods in Evolutionary Algorithms, including Genetic Algorithms, Evolution Strategies ES and Evolutionary Programming, EP are compared by observing the rate of converge...
Peter J. B. Hancock