Sciweavers

995 search results - page 124 / 199
» complexity 2011
Sort
View
164
Voted
SIAMSC
2011
85views more  SIAMSC 2011»
14 years 6 months ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss
138
Voted
FEDCSIS
2011
90views more  FEDCSIS 2011»
14 years 3 months ago
Services Composition Model for Home-Automation peer-to-peer Pervasive Computing
—Collaborative mechanisms between services are a crucial aspect in the recent development of pervasive computing systems based on the paradigm of service-oriented architecture. C...
Juan A. Holgado-Terriza, Sandra Rodríguez-V...
158
Voted
IACR
2011
111views more  IACR 2011»
14 years 3 months ago
Secure Multi-Party Sorting and Applications
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
Kristján Valur Jónsson, Gunnar Kreit...
141
Voted
IACR
2011
155views more  IACR 2011»
14 years 3 months ago
Terminating BKZ
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
IACR
2011
104views more  IACR 2011»
14 years 3 months ago
Collusion Resistant Obfuscation and Functional Re-encryption
Program Obfuscation is the problem of transforming a program into one which is functionally equivalent, yet whose inner workings are completely unintelligible to an adversary. Des...
Nishanth Chandran, Melissa Chase, Vinod Vaikuntana...