Sciweavers

3875 search results - page 693 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
ICCV
2009
IEEE
15 years 21 days ago
Extending Continuous Cuts: Anisotropic Metrics and Expansion Moves
The concept of graph cuts is by now a standard method for all sorts of low level vision problems. Its popularity is largely due to the fact that globally or near globally optimal...
Carl Olsson, Martin Byr¨od, Niels Chr. Overgaard,...
CVPR
2001
IEEE
14 years 9 months ago
Generic Model Abstraction from Examples
Model Abstraction from Examples Yakov Keselman, Member, IEEE, and Sven Dickinson, Member, IEEE The recognition community has typically avoided bridging the representational gap bet...
Yakov Keselman, Sven J. Dickinson
CVPR
2003
IEEE
14 years 9 months ago
Constrained Subspace Modelling
When performing subspace modelling of data using Principal Component Analysis (PCA) it may be desirable to constrain certain directions to be more meaningful in the context of the...
Jaco Vermaak, Patrick Pérez
ICDE
2004
IEEE
111views Database» more  ICDE 2004»
14 years 9 months ago
Modeling Uncertainties in Publish/Subscribe Systems
In the publish/subscribe paradigm, information providers disseminate publications to all consumers who have expressed interest by registering subscriptions. This paradigm has foun...
Haifeng Liu, Hans-Arno Jacobsen
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
14 years 8 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li