Sciweavers

903 search results - page 60 / 181
» On the reduction of a random basis
Sort
View
ECCV
2006
Springer
16 years 8 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
BMCBI
2006
105views more  BMCBI 2006»
15 years 6 months ago
CRNPRED: highly accurate prediction of one-dimensional protein structures by large-scale critical random networks
Background: One-dimensional protein structures such as secondary structures or contact numbers are useful for three-dimensional structure prediction and helpful for intuitive unde...
Akira R. Kinjo, Ken Nishikawa
PAMI
2008
198views more  PAMI 2008»
15 years 6 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
ASIACRYPT
2004
Springer
15 years 11 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan
IOR
2008
91views more  IOR 2008»
15 years 6 months ago
A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain. The number of steps in the chain can be random an...
Pierre L'Ecuyer, Christian Lécot, Bruno Tuf...