Sciweavers

119 search results - page 18 / 24
» A relaxed approach to combinatorial problems in robustness a...
Sort
View
ICPR
2006
IEEE
14 years 10 months ago
Convex Quadratic Programming for Object Localization
We set out an object localization scheme based on a convex programming matching method. The proposed approach is designed to match general objects, especially objects with very li...
Hao Jiang, Mark S. Drew, Ze-Nian Li
ML
2010
ACM
193views Machine Learning» more  ML 2010»
13 years 3 months ago
On the eigenvectors of p-Laplacian
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
Dijun Luo, Heng Huang, Chris H. Q. Ding, Feiping N...
IJCV
2006
299views more  IJCV 2006»
13 years 8 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
JMLR
2010
159views more  JMLR 2010»
13 years 3 months ago
Inference of Sparse Networks with Unobserved Variables. Application to Gene Regulatory Networks
Networks are becoming a unifying framework for modeling complex systems and network inference problems are frequently encountered in many fields. Here, I develop and apply a gener...
Nikolai Slavov
ICPR
2008
IEEE
14 years 3 months ago
Grading nuclear pleomorphism on histological micrographs
A mainstay in cancer diagnostics is the classification or grading of cell nuclei based on their appearance. While the analysis of cytological samples has been automated successful...
Eric Cosatto, Matthew Miller, Hans Peter Graf, Joh...