Sciweavers

726 search results - page 11 / 146
» Recent advances in computational models of natural argument
Sort
View
IACR
2011
152views more  IACR 2011»
12 years 7 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
WSC
1996
13 years 8 months ago
New Advances and Applications of Combining Simulation and Optimization
The area of integrating simulation and optimization has recently undergone remarkable changes. New advances are making available applications of simulation that previously had bee...
Fred Glover, James P. Kelly, Manuel Laguna
CVPR
2007
IEEE
14 years 9 months ago
What makes a good model of natural images?
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
Yair Weiss, William T. Freeman
IPPS
2003
IEEE
14 years 20 days ago
Natural Block Data Decomposition for Heterogeneous Clusters
We propose general purposes natural heuristics for static block and block-cyclic heterogeneous data decomposition over processes of parallel program mapped into multidimensional g...
Egor Dovolnov, Alexey Kalinov, Sergey Klimov
ICIP
2008
IEEE
14 years 1 months ago
Localized and computationally efficient approach to shift-variant image deblurring
A new localized and computationally efficient approach is presented for shift/space-variant image restoration. Unlike conventional approaches, it models shift-variant blurring in...
Murali Subbarao, Youn-sik Kang, Satyaki Dutta, Xue...