Results 1 - 10 of 5,898

How To Prove Yourself: Practical Solutions to Identification and Signature Problems

by Amos Fiat, Adi Shamir , 1987
"... In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack ff factoring is difficult ..."
Abstract - Cited by 1028 (1 self) - Add to MetaCart
In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack ff factoring

Using Predictive Prefetching to Improve World Wide Web Latency

by Venkata N. Padmanabhan, Jeffrey C. Mogul - COMPUTER COMMUNICATION REVIEW , 1996
"... The long-term success of the World Wide Web depends on fast response time. People use the Web to access information from remote sites, but do not like to wait long for their results. The latency of retrieving a Web document depends on several factors such as the network bandwidth, propagation tim ..."
Abstract - Cited by 341 (5 self) - Add to MetaCart
time and the speed of the server and client computers. Although several proposals have been made for reducing this latency, it is difficult to push it to the point where it becomes insignificant. This motivates our work, where we investigate a scheme for reducing the latency perceived by users

vic: A Flexible Framework for Packet Video

by Steven Mccanne, Van Jacobson - ACM Multimedia , 1995
"... The deployment of IP Multicast has fostered the development of a suite of applications, collectively known as the MBone tools, for real-time multimedia conferencingover the Internet. Two of these tools --- nv from Xerox PARC and ivs from INRIA --- provide video transmission using softwarebased codec ..."
Abstract - Cited by 369 (18 self) - Add to MetaCart
, and support for diverse compression algorithms. We also propose a novel compression scheme called "IntraH. 261". Created as a hybrid of the nv and ivs codecs, IntraH. 261 provides a factor of 2-3 improvement in compression gain over the nv encoder (6 dB of PSNR) as well as a substantial improvement

Multiuser OFDM with Adaptive Subcarrier, Bit, and Power Allocation

by Cheong Yui Wong, Roger S. Cheng, Khaled Ben Letaief , Ross D. Murch - IEEE JOURNAL ON SELECTED AREAS OF COMMUNICATIONS , 1999
"... Multiuser orthogonal frequency division multiplexing (OFDM) with adaptive multiuser subcarrier allocation and adaptive modulation is considered. Assuming knowledge of the instantaneous channel gains for all users, we propose a multiuser OFDM subcarrier, bit, and power allocation algorithm to minimiz ..."
Abstract - Cited by 360 (3 self) - Add to MetaCart
allocation schemes. We have also quantified the improvement in terms of the overall required transmit power, the bit-error rate (BER), or the area of coverage for a given outage probability.

The TIGER Treebank

by Sabine Brants, Stefanie Dipper, Silvia Hansen, Wolfgang Lezius, George Smith , 2002
"... This paper reports on the TIGER Treebank, a corpus of currently 35.000 syntactically annotated German newspaper sentences. We describe what kind of information is encoded in the treebank and introduce the different representation formats that are used for the annotation and exploitation of the tr ..."
Abstract - Cited by 332 (3 self) - Add to MetaCart
of the treebank. We explain the different methods used for the annotation: interactive annotation, using the tool Annotate, and LFG parsing. Furthermore, we give an account of the annotation scheme used for the TIGER treebank. This scheme is an extended and improved version of the NEGRA annotation scheme

A Vector-Perturbation technique for Near-Capacity . . .

by Christian B. Peel, Bertrand M. Hochwald, A. Lee Swindlehurst - IEEE TRANS. COMMUN , 2005
"... Recent theoretical results describing the sum capacity when using multiple antennas to communicate with multiple users in a known rich scattering environment have not yet been followed with practical transmission schemes that achieve this capacity. We introduce a simple encoding algorithm that achi ..."
Abstract - Cited by 323 (10 self) - Add to MetaCart
Recent theoretical results describing the sum capacity when using multiple antennas to communicate with multiple users in a known rich scattering environment have not yet been followed with practical transmission schemes that achieve this capacity. We introduce a simple encoding algorithm

Revocation and Tracing Schemes for Stateless Receivers

by Dalit Naor, Moni Naor, Jeff Lotspiech , 2001
"... Abstract. We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of the message. We concentrate on the stateless receiver case, where the users do not (necessarily) update their ..."
Abstract - Cited by 250 (5 self) - Add to MetaCart
Subset-Cover revocation algorithms; these algorithms are very flexible and work for any number of revoked users. The schemes require storage at the receiver of log N and 1 2 log2 N keys respectively (N is the total number of users), and in order to revoke r users the required message lengths are of r log

Information fusion in biometrics

by Arun Ross, Anil Jain - Pattern Recognition Letters , 2003
"... User verification systems that use a single biometric indicator often have to contend with noisy sensor data, restricted degrees of freedom, non-universality of the biometric trait and unacceptable error rates. Attempting to improve the performance of individual matchers in such situations may not p ..."
Abstract - Cited by 292 (17 self) - Add to MetaCart
User verification systems that use a single biometric indicator often have to contend with noisy sensor data, restricted degrees of freedom, non-universality of the biometric trait and unacceptable error rates. Attempting to improve the performance of individual matchers in such situations may

OCB: A Block-Cipher Mode of Operation for Efficient Authenticated Encryption

by Phillip Rogaway, Mihir Bellare, John Black, Ted Krovetz , 2001
"... We describe a parallelizable block-cipher mode of operation that simultaneously provides privacy and authenticity. OCB encrypts-and-authenticates a nonempty string M # {0, 1} # using #|M |/n# + 2 block-cipher invocations, where n is the block length of the underlying block cipher. Additional ov ..."
Abstract - Cited by 204 (24 self) - Add to MetaCart
-precision addition; a nearly optimal number of block-cipher calls; and no requirement for a random IV. We prove OCB secure, quantifying the adversary's ability to violate privacy or authenticity in terms of the quality of the block cipher as a pseudorandom permutation (PRP) or as a strong PRP, respectively

CODA: Congestion detection and avoidance in sensor networks

by Chieh-yih Wan, Shane B. Eisenman , 2003
"... Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is likely to lead to varying degrees of congestion in the network depending on the sensing application. It is during these pe ..."
Abstract - Cited by 244 (9 self) - Add to MetaCart
these periods of event impulses that the likelihood of congestion is greatest and the information in transit of most importance to users. To address this challenge we propose an energy efficient congestion control scheme for sensor networks called CODA (COngestion Detection and Avoidance) that comprises three
Results 1 - 10 of 5,898