Sciweavers

85 search results - page 2 / 17
» Multi-Level Probabilistic Relaxation
Sort
View
EMMCVPR
2011
Springer
12 years 6 months ago
Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
Jan Lellmann, Frank Lenzen, Christoph Schnörr
DAC
1998
ACM
14 years 7 months ago
Hierarchical Algorithms for Assessing Probabilistic Constraints on System Performance
We propose an algorithm for assessing probabilistic performance constraints for systems including components with uncertain delays. We make a case for designing systems based on a...
Gustavo de Veciana, Margarida F. Jacome, J.-H. Guo
CORR
2012
Springer
220views Education» more  CORR 2012»
12 years 2 months ago
Sparse Topical Coding
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
Jun Zhu, Eric P. Xing
NIPS
2007
13 years 7 months ago
CPR for CSPs: A Probabilistic Relaxation of Constraint Propagation
This paper proposes constraint propagation relaxation (CPR), a probabilistic approach to classical constraint propagation that provides another view on the whole parametric family...
Luis E. Ortiz
SMA
1993
ACM
107views Solid Modeling» more  SMA 1993»
13 years 10 months ago
Relaxed parametric design with probabilistic constraints
: Parametric design is an important modeling paradigm in computer aided design. Relationships (constraints) between the degrees of freedom (DOFs) of the model, instead of the DOFs ...
Yacov Hel-Or, Ari Rappoport, Michael Werman