Sciweavers

3991 search results - page 165 / 799
» Bounding homogeneous models
Sort
View
IJCV
2008
172views more  IJCV 2008»
13 years 7 months ago
Nonparametric Bayesian Image Segmentation
Image segmentation algorithms partition the set of pixels of an image into a specific number of different, spatially homogeneous groups. We propose a nonparametric Bayesian model f...
Peter Orbanz, Joachim M. Buhmann
TII
2010
110views Education» more  TII 2010»
13 years 2 months ago
An Efficient Threshold-Based Power Management Mechanism for Heterogeneous Soft Real-Time Clusters
With growing cost of electricity, the power management of server clusters has become an important problem. However, most previous researchers only address the challenge in homogen...
Leping Wang, Ying Lu
LICS
2012
IEEE
11 years 10 months ago
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
Serge Haddad, Sylvain Schmitz, Philippe Schnoebele...
COCO
2007
Springer
91views Algorithms» more  COCO 2007»
14 years 2 months ago
Lower Bounds for Multi-Player Pointer Jumping
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
Amit Chakrabarti
UAI
2003
13 years 9 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...