Sciweavers

1795 search results - page 321 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 3 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
DAWAK
2004
Springer
14 years 3 months ago
Conceptual Design of XML Document Warehouses
EXtensible Markup Language (XML) has emerged as the dominant standard in describing and exchanging data among heterogeneous data sources. XML with its self-describing hierarchical ...
Vicky Nassis, Rajagopal Rajugan, Tharam S. Dillon,...
IMR
2004
Springer
14 years 3 months ago
3D Hybrid Mesh Generation for Reservoir Flow Simulation
A great challenge for flow simulators of new generation is to gain more accuracy at well proximity within complex geological structures. For this purpose, a new approach based on...
N. Flandrin, Houman Borouchaki, Chakib Bennis
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
14 years 3 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
FOSSACS
2001
Springer
14 years 2 months ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin