Sciweavers

11345 search results - page 1571 / 2269
» Foundations of Computer Science
Sort
View
FOCS
2005
IEEE
16 years 1 months ago
The Complexity of Online Memory Checking
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
Moni Naor, Guy N. Rothblum
MICAI
2005
Springer
16 years 28 days ago
Agent-Based Simulation Replication: A Model Driven Architecture Approach
In Multi-agent based simulation (MABS) systems, computational models are built as multi-agent systems (MAS). Replication of these models can contribute to improve the reliability o...
Candelaria Sansores, Juan Pavón
GI
2004
Springer
16 years 25 days ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
HPCN
1999
Springer
15 years 11 months ago
GeoFEM: High Performance Parallel FEM for Solid Earth
hima and I. Fujishiro, "Measuring volumetric coherence," In ACM SIGGRAPH98 Conference Abstracts and Applications, p.260, July 1998. 1999 K.Garatani, H.Nakamura, H.Okuda a...
Kazuteru Garatani, Hisashi Nakamura, Hiroshi Okuda...
ERSHOV
2009
Springer
15 years 11 months ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...
« Prev « First page 1571 / 2269 Last » Next »