Sciweavers

2200 search results - page 34 / 440
» Bloch's Constant is Computable
Sort
View
BIRTHDAY
2003
Springer
15 years 3 months ago
On the Computational Complexity of Hierarchical Radiosity
The hierarchical radiosity algorithm is an efficient approach to simulation of light with the goal of photo-realistic image rendering. Hanrahan et. al. describe the initialization ...
Robert Garmann, Heinrich Müller
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
13 years 9 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...
ECCV
2002
Springer
15 years 11 months ago
Adaptive Rest Condition Potentials: Second Order Edge-Preserving Regularization
Abstract. The propose of this paper is to introduce a new regularization formulation for inverse problems in computer vision and image processing that allows one to reconstruct sec...
José L. Marroquín, Mariano Rivera
GD
2004
Springer
15 years 3 months ago
On the Realizable Weaving Patterns of Polynomial Curves in R3
We prove that the number of distinct weaving patterns produced by n semi-algebraic curves in R3 defined coordinate-wise by polynomials of degrees bounded by some constant d, is b...
Saugata Basu, Raghavan Dhandapani, Richard Pollack
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
13 years 8 days ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...