Sciweavers

433 search results - page 8 / 87
» Generalized Ham-Sandwich Cuts
Sort
View
JMLR
2010
159views more  JMLR 2010»
13 years 2 months ago
Semi-Supervised Learning with Max-Margin Graph Cuts
This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic fun...
Branislav Kveton, Michal Valko, Ali Rahimi, Ling H...
CVPR
2008
IEEE
14 years 9 months ago
Discovering class specific composite features through discriminative sampling with Swendsen-Wang Cut
This paper proposes a novel approach to discover a set of class specific "composite features" as the feature pool for the detection and classification of complex objects...
Feng Han, Ying Shan, Harpreet S. Sawhney, Rakesh K...
CSL
2007
Springer
14 years 1 months ago
A Cut-Free and Invariant-Free Sequent Calculus for PLTL
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
14 years 7 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
WADS
2009
Springer
256views Algorithms» more  WADS 2009»
14 years 1 months ago
Dynamic Graph Clustering Using Minimum-Cut Trees
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
Robert Görke, Tanja Hartmann, Dorothea Wagner