Sciweavers

8671 search results - page 1577 / 1735
» A generator for hierarchical problems
Sort
View
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 25 days ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
FOCS
2000
IEEE
14 years 22 days ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
INFOCOM
2000
IEEE
14 years 21 days ago
Energy Conserving Routing in Wireless Ad-hoc Networks
— An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and need...
Jae-Hwan Chang, Leandros Tassiulas
ISSRE
2000
IEEE
14 years 21 days ago
Building Trust into OO Components Using a Genetic Analogy
Despite the growing interest for component-based systems, few works tackle the question of the trust we can bring into a component. This paper presents a method and a tool for bui...
Benoit Baudry, Vu Le Hanh, Jean-Marc Jéz&ea...
ELPUB
1999
ACM
14 years 19 days ago
Online Publishing as a Support for Scholarly Communication in Dynamic Knowledge Communities
Internet based services, particularly asynchronous communication services, offer an environment suited to the rise of knowledge communities. Knowledge communities, or invisible co...
Ana Alice Baptista, Elóy Rodrigues, Altamir...
« Prev « First page 1577 / 1735 Last » Next »