Sciweavers

489 search results - page 39 / 98
» Communication Complexity of Permutation-Invariant Functions
Sort
View
JOC
2008
86views more  JOC 2008»
14 years 10 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
ICC
2007
IEEE
303views Communications» more  ICC 2007»
15 years 5 months ago
Frequency Domain Channel Estimation for OFDM Based on Slepian Basis Expansion
Abstract—In this paper we propose a low complexity frequency domain channel estimator for pilot-symbol-assisted (PSA) orthogonal frequency division multiplexing (OFDM) systems in...
Jinho Kim, Chih-Wei Wang, Wayne E. Stark
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
15 years 1 days ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
BIOSIG
2009
152views Biometrics» more  BIOSIG 2009»
14 years 8 months ago
A Survey of Distributed Biometric Authentication Systems
: In ACISP'07, Bringer et al proposed a new approach for remote biometric based verification, which consists of a hybrid protocol that distributes the server side functionalit...
Neyire Deniz Sarier
103
Voted
HCW
1998
IEEE
15 years 2 months ago
On the Interaction between Mobile Processes and Objects
Java's remote method invocation mechanism provides a number of features that extend the functionality of traditional client server-based distributed systems. However, there a...
Suresh Jagannathan, Richard Kelsey