Sciweavers

2638 search results - page 506 / 528
» Random Geometric Complexes
Sort
View
198
Voted
EUROCRYPT
2004
Springer
16 years 4 days ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
220
Voted
FSTTCS
2004
Springer
16 years 4 days ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
205
Voted
GECCO
2004
Springer
139views Optimization» more  GECCO 2004»
16 years 4 days ago
Chemical Genetic Programming - Coevolution Between Genotypic Strings and Phenotypic Trees
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
Wojciech Piaseczny, Hideaki Suzuki, Hidefumi Sawai
HSNMC
2004
Springer
125views Multimedia» more  HSNMC 2004»
16 years 4 days ago
A Pull-Based Approach for a VoD Service in P2P Networks
We study a new approach to provide an efficient VoD service to a large client population in P2P networks. Previous work has suggested to construct a multicast tree to distribute t...
Anwar Al Hamra, Ernst W. Biersack, Guillaume Urvoy...
IWQOS
2004
Springer
16 years 3 days ago
Small world overlay P2P networks
In this paper, we consider how to “construct” and “maintain” an overlay structured P2P network based on the “smallworld paradigm”. Two main attractive properties of a ...
Ken Y. K. Hui, John C. S. Lui, David K. Y. Yau