Sciweavers

18 search results - page 3 / 4
» Globally Optimal Pixel Labeling Algorithms for Tree Metrics
Sort
View
ICML
2004
IEEE
14 years 8 months ago
Large margin hierarchical classification
We present an algorithmic framework for supervised classification learning where the set of labels is organized in a predefined hierarchical structure. This structure is encoded b...
Ofer Dekel, Joseph Keshet, Yoram Singer
ICML
2010
IEEE
13 years 8 months ago
Random Spanning Trees and the Prediction of Weighted Graphs
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
ECCV
2006
Springer
14 years 9 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady
IPPS
1997
IEEE
13 years 12 months ago
On the Dynamic Initialization of Parallel Computers
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
ITSL
2008
13 years 9 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki