11151 search results - page 304 / 2231 » On the Complexity of Model Expansion |
290
click to vote
GMP
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
154
click to vote
SIGCOMM
1998
ACM
15 years 11 months ago
1998
ACM
Recently, a parametric State Reward Markov Model SRMM p has been developed for the reliability and availability analysis of self-healing SONET mesh networks 2 . In this paper, w...
185
Voted
APSEC
2007
IEEE
15 years 11 months ago
2007
IEEE
It is difficult to adopt a simulation technology for simulating a software process because of the difficulty in developing a simulation model. In order to resolve the difficulty, ...
202
Voted
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
228
Voted
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
We introduce a novel energy minimization method to decompose a video into a set of super-resolved moving layers. The proposed energy corresponds to the cost of coding the sequence...