Sciweavers

694 search results - page 70 / 139
» The Power of the Middle Bit
Sort
View
INFOSCALE
2006
ACM
14 years 2 months ago
Evaluation of network impact of content distribution mechanisms
Efficient large-scale content distribution continues to be an important problem, due to the increasing popularity of multimedia content and wide-spread use of peer-to-peer file ...
Shibsankar Das, Jussi Kangasharju
PODC
1993
ACM
14 years 4 days ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
CRYPTO
2006
Springer
89views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Oblivious Transfer and Linear Functions
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
VIP
2000
13 years 9 months ago
A Simulation Study of Using ER Feedback Control to Transport Compressed Video over ATM Networks
Transporting video over asynchronous transfer mode (ATM) networks has been an active area of research. The Variable Bit rate (VBR) service in ATM networks is primarily designed an...
Xiaomei Yu, Doan B. Hoang, David Dagan Feng
VLSID
2009
IEEE
119views VLSI» more  VLSID 2009»
14 years 8 months ago
Single Ended Static Random Access Memory for Low-Vdd, High-Speed Embedded Systems
Abstract-- Single-ended static random access memory (SESRAM) is well known for their tremendous potential of low active power and leakage dissipations. In this paper, we present a ...
Jawar Singh, Jimson Mathew, Saraju P. Mohanty, Dhi...