Sciweavers

666 search results - page 108 / 134
» Unbalanced Graph Cuts
Sort
View
CVPR
2010
IEEE
14 years 6 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...
CVPR
2008
IEEE
14 years 4 months ago
Normalized tree partitioning for image segmentation
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
Jingdong Wang, Yangqing Jia, Xian-Sheng Hua, Chang...
ICDM
2007
IEEE
192views Data Mining» more  ICDM 2007»
14 years 4 months ago
Discovering Temporal Communities from Social Network Documents
Discovering communities from documents involved in social discourse is an important topic in social network analysis, enabling greater understanding of the relationships among act...
Ding Zhou, Isaac G. Councill, Hongyuan Zha, C. Lee...
BVAI
2007
Springer
14 years 4 months ago
Classification with Positive and Negative Equivalence Constraints: Theory, Computation and Human Experiments
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
Rubi Hammer, Tomer Hertz, Shaul Hochstein, Daphna ...
SOFSEM
2007
Springer
14 years 4 months ago
Exact Max 2-Sat: Easier and Faster
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
Martin Fürer, Shiva Prasad Kasiviswanathan