Results 1  10
of
6,069
Additive BitSerial Algorithm for Discrete
"... Introduction and summary: Hardware capabilities for integer arithmetic generally include addition, multiplication, and division with precision k typically chosen as 16, 32 or 64. Multiplication and division are often implemented by recursive bit serial algorithms employing O(k) serial additions to a ..."
Abstract
 Add to MetaCart
Introduction and summary: Hardware capabilities for integer arithmetic generally include addition, multiplication, and division with precision k typically chosen as 16, 32 or 64. Multiplication and division are often implemented by recursive bit serial algorithms employing O(k) serial additions
The knowledge complexity of interactive proof systems

, 1989
"... Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/nonHamiltonian. In th ..."
Abstract

Cited by 1246 (39 self)
 Add to MetaCart
Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian
Quantization Index Modulation: A Class of Provably Good Methods for Digital Watermarking and Information Embedding
 IEEE TRANS. ON INFORMATION THEORY
, 1999
"... We consider the problem of embedding one signal (e.g., a digital watermark), within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing informationembedding rate, mini ..."
Abstract

Cited by 496 (14 self)
 Add to MetaCart
distortionrobustness tradeoffs than currently popular spreadspectrum and lowbit(s) modulation methods. Furthermore, we show that for some important classes of probabilistic models, DCQIM is optimal (capacityachieving) and regular QIM is nearoptimal. These include both additive white Gaussian noise
Random Early Detection Gateways for Congestion Avoidance.
 IEEELACM Transactions on Networking,
, 1993
"... AbstractThis paper presents Random Early Detection (RED) gateways for congestion avoidance in packetswitched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract

Cited by 2716 (31 self)
 Add to MetaCart
at the gateway or by setting a bit in packet headers. When the average queue size exceeds a preset threshold, the gateway drops or marks each arriving packet with a certain probability, where the exact probability is a function of the average queue size. RED gateways keep the average queue size low while
A Proposal to add Explicit Congestion Notification (ECN) to IP
, 1999
"... This note describes a proposed addition of ECN (Explicit Congestion Notification) to IP. TCP is currently the dominant transport protocol used in the Internet. We begin by describing TCP's use of packet drops as an indication of congestion. Next we argue that with the addition of active queue m ..."
Abstract

Cited by 472 (26 self)
 Add to MetaCart
This note describes a proposed addition of ECN (Explicit Congestion Notification) to IP. TCP is currently the dominant transport protocol used in the Internet. We begin by describing TCP's use of packet drops as an indication of congestion. Next we argue that with the addition of active queue
Interprocedural dataflow analysis via graph reachability
, 1994
"... The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow fun ..."
Abstract

Cited by 454 (34 self)
 Add to MetaCart
functions must distribute over the confluence operator (either union or intersection). This class of problems includes—but is not limited to—the classical separable problems (also known as “gen/kill ” or “bitvector” problems)—e.g., reaching definitions, available expressions, and live variables
Probabilistic Counting Algorithms for Data Base Applications
, 1985
"... This paper introduces a class of probabilistic counting lgorithms with which one can estimate the number of distinct elements in a large collection of data (typically a large file stored on disk) in a single pass using only a small additional storage (typically less than a hundred binary words) a ..."
Abstract

Cited by 444 (6 self)
 Add to MetaCart
This paper introduces a class of probabilistic counting lgorithms with which one can estimate the number of distinct elements in a large collection of data (typically a large file stored on disk) in a single pass using only a small additional storage (typically less than a hundred binary words
Linear multiuser detectors for synchronous codedivision multipleaccess channels
 IEEE TRANS. INFORM. THEORY
, 1989
"... In codedivision multipleaccess systems, simultaneous multiuser accessing of a common channel is made possible by assigning a signature waveform to each user. Knowledge of these waveforms enables the receiver to demodulate the data streams of each user, upon observation of the sum of the transmitt ..."
Abstract

Cited by 385 (4 self)
 Add to MetaCart
of the transmitted signals, perturbed by additive noise. Under the assumptions of symbolsynchronous transmissions and white Gaussian noise, we analyze the detection mechanism at the receiver, comparing different detectors by their bit error rate in the low background noise region, and by their worstcase behavior
Improving Reliable Transport and Handoff Performance in Cellular Wireless Networks
, 1995
"... TCP is a reliable transport protocol tuned to perform well in traditional networks where congestion is the primary cause of packet loss. However, networks with wireless links and mobile hosts incur significant losses due to biterrors and handoff. This environment violates many of the assumptions mad ..."
Abstract

Cited by 389 (22 self)
 Add to MetaCart
made by TCP, causing degraded endtoend performance. In this paper, we describe the additions and modifications to the standard Internet protocol stack (TCP/IP) to improve endtoend reliable transport performance in mobile environments. The protocol changes are made to networklayer software
Hardware Implementation of an Additive BitSerial Algorithm for the Discrete Logarithm Modulo 2 k
 Logarithm Modulo2 k ”, IEEE Symposium on VLSI
, 2005
"... We describe the hardware implementation of a novel algorithm for computing the discrete logarithm modulo 2 k. The circuit has a total latency of less than k tablelookupdetermined shiftandadd modulo 2 k operations. We introduce a onetoone mapping between kbit binary integers and kbit encoding ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We describe the hardware implementation of a novel algorithm for computing the discrete logarithm modulo 2 k. The circuit has a total latency of less than k tablelookupdetermined shiftandadd modulo 2 k operations. We introduce a onetoone mapping between kbit binary integers and kbit
Results 1  10
of
6,069