Sciweavers

358 search results - page 42 / 72
» Learning from labeled and unlabeled data on a directed graph
Sort
View
ICDM
2009
IEEE
97views Data Mining» more  ICDM 2009»
15 years 6 months ago
Hierarchical Probabilistic Segmentation of Discrete Events
—Segmentation, the task of splitting a long sequence of discrete symbols into chunks, can provide important information about the nature of the sequence that is understandable to...
Guy Shani, Christopher Meek, Asela Gunawardana
CVPR
2006
IEEE
16 years 1 months ago
Graph Laplacian Kernels for Object Classification from a Single Example
Classification with only one labeled example per class is a challenging problem in machine learning and pattern recognition. While there have been some attempts to address this pr...
Hong Chang, Dit-Yan Yeung
WWW
2010
ACM
15 years 6 months ago
Privacy wizards for social networking sites
Privacy is an enormous problem in online social networking sites. While sites such as Facebook allow users fine-grained control over who can see their profiles, it is difficult ...
Lujun Fang, Kristen LeFevre
ER
2006
Springer
112views Database» more  ER 2006»
15 years 3 months ago
A DAG Comparison Algorithm and Its Application to Temporal Data Warehousing
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
Johann Eder, Karl Wiggisser
ECCV
2008
Springer
16 years 1 months ago
Learning Two-View Stereo Matching
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching between two uncalibrated wide-baseline images by exploiting the results of sparse...
Jianxiong Xiao, Jingni Chen, Dit-Yan Yeung, Long Q...