Sciweavers

1951 search results - page 164 / 391
» An algorithm for improving graph partitions
Sort
View
CORR
2010
Springer
158views Education» more  CORR 2010»
15 years 1 months ago
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
Pascal O. Vontobel
173
Voted
SIGMOD
2010
ACM
243views Database» more  SIGMOD 2010»
15 years 5 months ago
Non-homogeneous generalization in privacy preserving data publishing
Most previous research on privacy-preserving data publishing, based on the k-anonymity model, has followed the simplistic approach of homogeneously giving the same generalized val...
Wai Kit Wong, Nikos Mamoulis, David Wai-Lok Cheung
140
Voted
CVPR
2010
IEEE
15 years 9 months ago
Efficient Hierarchical Graph-Based Video Segmentation
We present an efficient and scalable technique for spatiotemporal segmentation of long video sequences using a hierarchical graph-based algorithm. We begin by oversegmenting a vol...
Matthias Grundmann, Vivek Kwatra, Mei Han, Irfan E...
145
Voted
JMLR
2006
125views more  JMLR 2006»
15 years 5 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
ICCV
2011
IEEE
14 years 5 months ago
Recursive MDL via Graph Cuts: Application to Segmentation
We propose a novel patch-based image representation that is useful because it (1) inherently detects regions with repetitive structure at multiple scales and (2) yields a paramete...
Lena Gorelick, Andrew Delong, Olga Veksler, Yuri B...