Results 11  20
of
10,716
Parallel Prefix Computation
 JOURNAL OF THE ACM
, 1980
"... The prefix problem is to compute all the products x t o x2.... o xk for i ~ k. ~ n, where o is an associative operation A recursive construction IS used to obtain a product circuit for solving the prefix problem which has depth exactly [log:n] and size bounded by 4n An application yields fast, smal ..."
Abstract

Cited by 337 (1 self)
 Add to MetaCart
The prefix problem is to compute all the products x t o x2.... o xk for i ~ k. ~ n, where o is an associative operation A recursive construction IS used to obtain a product circuit for solving the prefix problem which has depth exactly [log:n] and size bounded by 4n An application yields fast
Computer Graphics during the 8bit Computer Game Era
 Siggraph Newsletter
, 1998
"... The technologies being employed in current games have advanced to the point where computer game companies are now leaders in graphics research and indeed the requirement for realistic realtime graphics has arguably ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
The technologies being employed in current games have advanced to the point where computer game companies are now leaders in graphics research and indeed the requirement for realistic realtime graphics has arguably
Value Locality and Load Value Prediction
, 1996
"... Since the introduction of virtual memory demandpaging and cache memories, computer systems have been exploiting spatial and temporal locality to reduce the average latency of a memory reference. In this paper, we introduce the notion of value locality, a third facet of locality that is frequently p ..."
Abstract

Cited by 391 (18 self)
 Add to MetaCart
Since the introduction of virtual memory demandpaging and cache memories, computer systems have been exploiting spatial and temporal locality to reduce the average latency of a memory reference. In this paper, we introduce the notion of value locality, a third facet of locality that is frequently
A binary feedback scheme for congestion avoidance in computer networks
 ACM TRANSACTIONS ON COMPUTER SYSTEMS
, 1990
"... We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses feedback from the network to the users of the network. The interesting challenge for the scheme is to use a minimal amount of feedback (one bit in each packet) from the netw ..."
Abstract

Cited by 352 (23 self)
 Add to MetaCart
We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses feedback from the network to the users of the network. The interesting challenge for the scheme is to use a minimal amount of feedback (one bit in each packet) from
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
A Theory of Program Size Formally Identical to Information Theory
, 1975
"... A new definition of programsize complexity is made. H(A;B=C;D) is defined to be the size in bits of the shortest selfdelimiting program for calculating strings A and B if one is given a minimalsize selfdelimiting program for calculating strings C and D. This differs from previous definitions: (1) ..."
Abstract

Cited by 380 (15 self)
 Add to MetaCart
A new definition of programsize complexity is made. H(A;B=C;D) is defined to be the size in bits of the shortest selfdelimiting program for calculating strings A and B if one is given a minimalsize selfdelimiting program for calculating strings C and D. This differs from previous definitions: (1
64 bit Computer Architectures for Space Applications – A study
"... Abstract—The more recent satellite projects/programs makes extensive usage of real – time embedded systems. 16 bit processors which meet the MilStd1750 standard architecture have been used in onboard systems. Most of the Space Applications have been written in ADA. From a futuristic point of view ..."
Abstract
 Add to MetaCart
of view, 32 bit / 64 bit processors are needed in the area of spacecraft computing and therefore an effort is desirable in the study and survey of 64 bit architectures for space applications. This will also result in significant technology development in terms of VLSI and software tools for ADA (as
The Bits and Flops of the Nhop Multilateration Primitive For Node Localization Problems
, 2002
"... The recent advances in MEMS, embedded systems and wireless communication technologies are making the realization and deployment of networked wireless microsensors a tangible task. Vital to the success of wireless microsensor networks is the ability of microsensors to "collectively perform sensi ..."
Abstract

Cited by 280 (2 self)
 Add to MetaCart
sensing and computation". In this paper, we study one of the fundamental challenges in sensor networks, node localization. The collaborative multilateration presented here, enables adhoc deployed sensor nodes to accurately estimate their locations by using known beacon locations that are several
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
, 2000
"... In this paper we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: ffl we show how to maintain (using only O(log n=ffl 2 ) words of storage) a sketch C(p) of a point p 2 l n 1 under dynamic updates of its coo ..."
Abstract

Cited by 324 (13 self)
 Add to MetaCart
) such that the embedding can be represented using only O(n log 2 n) bits (as opposed to at least...
Elementary Gates for Quantum Computation
, 1995
"... We show that a set of gates that consists of all onebit quantum gates (U(2)) and the twobit exclusiveor gate (that maps Boolean values (x, y)to(x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n)) can be expressed as compositions of these gates. We in ..."
Abstract

Cited by 280 (11 self)
 Add to MetaCart
constructions of quantum computational networks. We derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two and threebit quantum gates, the asymptotic number required for nbit DeutschToffoli gates, and make some observations about the number required
Results 11  20
of
10,716