Sciweavers

4164 search results - page 695 / 833
» Application and desktop sharing
Sort
View
CORR
2006
Springer
132views Education» more  CORR 2006»
15 years 7 months ago
Packrat Parsing: Simple, Powerful, Lazy, Linear Time
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
161
Voted
FFA
2006
79views more  FFA 2006»
15 years 7 months ago
Lattice-based threshold-changeability for standard CRT secret-sharing schemes
We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the deal...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
GRID
2006
Springer
15 years 7 months ago
YA: Fast and Scalable Discovery of Idle CPUs in a P2P network
Discovery of large amounts of idle CPUs in fully distributed and shared Grid systems is needed in relevant applications and is still a challenging problem. In this paper we present...
Javier Celaya, Unai Arronategui
IJSI
2008
109views more  IJSI 2008»
15 years 7 months ago
Modular Church-Rosser Modulo: The Complete Picture
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
Jean-Pierre Jouannaud, Yoshihito Toyama
CL
2007
Springer
15 years 7 months ago
A bulk-synchronous parallel process algebra
The CCS (Calculus of Communicating Systems) process algebra is a well-known formal model of synchronization and communication. It is used for the analysis of safety and liveness i...
Armelle Merlin, Gaétan Hains