Sciweavers

663 search results - page 101 / 133
» A Parallel Algorithm for Enumerating Combinations
Sort
View
IPPS
1998
IEEE
15 years 6 months ago
Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
Wei Shi, Pradip K. Srimani
PDIS
1996
IEEE
15 years 6 months ago
Capabilities-Based Query Rewriting in Mediator Systems
Users today are struggling to integrate a broad range of information sources providing di erent levels of query capabilities. Currently, data sources with di erent and limitedcapa...
Yannis Papakonstantinou, Ashish Gupta, Laura M. Ha...
PODC
2010
ACM
15 years 6 months ago
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
James Aspnes
CW
2004
IEEE
15 years 6 months ago
Peer-to-Peer Networked Field-type Virtual Environment by Using AtoZ
This paper aims to study how to gain the consistency of the state in a DVE (Distributed Virtual Environment) with lag, under the condition of peer-to-peer architecture. That is, w...
Tatsuhiro Yonekura, Yoshihiro Kawano, Dai Hanawa
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
15 years 3 months ago
SWIFFT: A Modest Proposal for FFT Hashing
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
Vadim Lyubashevsky, Daniele Micciancio, Chris Peik...