Sciweavers

34 search results - page 4 / 7
» An analysis of graph cut size for transductive learning
Sort
View
AI
2006
Springer
13 years 7 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
ML
2010
ACM
193views Machine Learning» more  ML 2010»
13 years 2 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...
ICDAR
2011
IEEE
12 years 7 months ago
A Method of Evaluating Table Segmentation Results Based on a Table Image Ground Truther
—We propose a novel method to evaluate table segmentation results based on a table image ground truther. In the ground-truthing process, we first extract connected components fr...
Yanhui Liang, Yizhou Wang, Eric Saund
ECCB
2005
IEEE
14 years 1 months ago
A query language for biological networks
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
Ulf Leser
CVPR
2012
IEEE
11 years 10 months ago
Learning to segment dense cell nuclei with shape prior
We study the problem of segmenting multiple cell nuclei from GFP or Hoechst stained microscope images with a shape prior. This problem is encountered ubiquitously in cell biology ...
Xinghua Lou, Ullrich Köthe, Jochen Wittbrodt,...