Sciweavers

3395 search results - page 438 / 679
» A Statistical Clustering Model and Algorithm
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
ICCV
2009
IEEE
16 years 11 months ago
GroupSAC: Efficient Consensus in the Presence of Groupings
We present a novel variant of the RANSAC algorithm that is much more efficient, in particular when dealing with problems with low inlier ratios. Our algorithm assumes that there...
Kai Ni, Hailin Jin, Frank Dellaert
SAC
2010
ACM
15 years 12 months ago
User-controlled generalization boundaries for p-sensitive k-anonymity
Numerous privacy models based on the k-anonymity property have been introduced in the last few years. While differing in their methods and quality of their results, they all focus...
Alina Campan, Traian Marius Truta, Nicholas Cooper
BMCBI
2008
158views more  BMCBI 2008»
15 years 6 months ago
Analyzing M-CSF dependent monocyte/macrophage differentiation: Expression modes and meta-modes derived from an independent compo
Background: The analysis of high-throughput gene expression data sets derived from microarray experiments still is a field of extensive investigation. Although new approaches and ...
Dominik Lutter, Peter Ugocsai, Margot Grandl, Evel...
CORR
1999
Springer
98views Education» more  CORR 1999»
15 years 6 months ago
A variational description of the ground state structure in random satisfiability problems
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
Giulio Biroli, Rémi Monasson, Martin Weigt