Sciweavers

71 search results - page 3 / 15
» Automorphisms of Finite Rings and Applications to Complexity...
Sort
View
COCOA
2010
Springer
13 years 4 months ago
Time Optimal Algorithms for Black Hole Search in Rings
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
MOC
2010
13 years 1 months ago
Analysis of a finite PML approximation to the three dimensional elastic wave scattering problem
We consider the application of a perfectly matched layer (PML) technique to approximate solutions to the elastic wave scattering problem in the frequency domain. The PML is viewed ...
James H. Bramble, Joseph E. Pasciak, Dimitar Trene...
LPNMR
2007
Springer
14 years 14 days ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
COMPUTING
2008
174views more  COMPUTING 2008»
13 years 6 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
13 years 8 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III