Sciweavers

3600 search results - page 62 / 720
» The settling-time reducibility ordering
Sort
View
CGF
2004
93views more  CGF 2004»
13 years 10 months ago
Instant Volumetric Understanding with Order-Independent Volume Rendering
Rapid, visual understanding of volumetric datasets is a crucial outcome of a good volume rendering application, but few current volume rendering systems deliver this result. Our g...
Benjamin Mora, David S. Ebert
CVPR
2009
IEEE
15 years 5 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
CVPR
2006
IEEE
15 years 12 days ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
ICIP
2003
IEEE
15 years 10 hour ago
Efficient frame vector selection based on ordered sets
The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method o...
Tom Ryen, Guido M. Schuster, Aggelos K. Katsaggelo...
DAC
2006
ACM
14 years 11 months ago
Fast analysis of structured power grid by triangularization based structure preserving model order reduction
In this paper, a Triangularization Based Structure preserving (TBS) model order reduction is proposed to verify power integrity of on-chip structured power grid. The power grid is...
Hao Yu, Yiyu Shi, Lei He