Sciweavers

604 search results - page 4 / 121
» The Hardness of Metric Labeling
Sort
View
RTS
2002
111views more  RTS 2002»
13 years 7 months ago
Robust Adaptive Metrics for Deadline Assignment in Distributed Hard Real-Time Systems
Distributed real-time applications usually consist of several component tasks and must be completed by its end-to-end (E-T-E) deadline. As long as the E-T-E deadline of an applicat...
Jan Jonsson, Kang G. Shin
HAPTICS
2010
IEEE
14 years 3 days ago
Extended Rate-Hardness: A Measure for Perceived Hardness
This paper presents a measure for assessing the perceived hardness of a haptic surface based on associated physical variables. This metric, named extended rate-hardness (ERH), is e...
Gabjong Han, Seungmoon Choi
CVPR
2010
IEEE
14 years 4 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
14 years 8 months ago
On earthmover distance, metric labeling, and 0-extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...
ICML
2006
IEEE
14 years 9 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty