Sciweavers

3994 search results - page 776 / 799
» Supporting the design of network-spanning applications
Sort
View
97
Voted
SPAA
2004
ACM
15 years 2 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
CCS
2004
ACM
15 years 2 months ago
On achieving software diversity for improved network security using distributed coloring algorithms
It is widely believed that diversity in operating systems, software packages, and hardware platforms will decrease the virulence of worms and the effectiveness of repeated applic...
Adam J. O'Donnell, Harish Sethu
EUROCRYPT
2004
Springer
15 years 2 months ago
Traceable Signatures
Abstract. This work presents a new privacy primitive called “Traceable Signatures”, together with an efficient provably secure implementation. To this end, we develop the unde...
Aggelos Kiayias, Yiannis Tsiounis, Moti Yung
FC
2004
Springer
89views Cryptology» more  FC 2004»
15 years 2 months ago
Electronic National Lotteries
We describe the design and implementation of secure and robust protocol and system for a national electronic lottery. Electronic lotteries at a national level are a viable cost e...
Elisavet Konstantinou, Vasiliki Liagkou, Paul G. S...
GECCO
2004
Springer
145views Optimization» more  GECCO 2004»
15 years 2 months ago
Search Based Automatic Test-Data Generation at an Architectural Level
Abstract. The need for effective testing techniques for architectural level descriptions is widely recognised. However, due to the variety of domain-specific architectural descript...
Yuan Zhan, John A. Clark