- Full text PDF available (182)
- This year (12)
- Last 5 years (61)
- Last 10 years (90)
Journals and Conferences
Data Set Used
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the <italic>positions</italic> of routers and a packet's destination to make packet forwarding decisions. GPSR makes <italic>greedy</italic> forwarding decisions using only information about a router's immediate neighbors in the network… (More)
Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are “optimistic” in the sense that they rely mainly on transaction backup as a control mechanism, “hoping” that… (More)
In this paper, the <italic>red-blue pebble game</italic> is proposed to model the input-output complexity of algorithms. Using the pebble game formulation, a number of lower bound results for the I/O requirement are proven. For example, it is shown that to perform the n-point FFT or the ordinary n×n matrix multiplication algorithm with O(S) memory, at… (More)
With VLSI architecture, the chip area and design regularity represent a better measure of cost than the conventional gate count. We show that addition of n-bit binary numbers can be performed on a chip with a regular layout in time proportional to log n and with area proportional to n.
ASSTRACT. Let U1 , U2, . . . , Ud be totally ordered sets and let V be a set of n d-dimensional vectors In U~ X Us. . X Ud . A partial ordering is defined on V in a natural way The problem of finding all maximal elements of V with respect to the partial ordering ~s considered The computational complexity of the problem is defined to be the number of… (More)
The problem is to calculate a simple zero of a nonlinear function ƒ by iteration. There is exhibited a family of iterations of order 2<supscrpt><italic>n</italic>-1</supscrpt> which use <italic>n</italic> evaluations of ƒ and no derivative evaluations, as well as a second family of iterations of order 2<supscrpt><italic>n</italic>-1</supscrpt>… (More)
f High-performance, special-purpose computer systems are typically used to meet specific application requirements or to off-load computations that are especially taxing to general-purpose computers. As hardware cost and size continue to drop and processing requirements become well-understood in areas such as signal and image processing, more special-purpose… (More)
Two algorithms for sorting n<supscrpt>2</supscrpt> elements on an n×n mesh-connected processor array that require 0(n) routing and comparison steps are presented. The best previous algorithms take time 0(n log n). Our algorithms are shown to be optimal in time within small constant factors.
3 The classical algorithms require 0(n ) operations to compute the first n terms in the reversion of a power series or the composition of two series 2 and 0(n log n) operations if the fast Fourier transform is used for power series multiplication. In this paper we show that the composition and reversion problems are equivalent (up to constant factors), and… (More)
We apply sensor networks to the problem of tracking moving objects. We describe a publish-and-subscribe tracking method, called Scalable Tracking Using Networked Sensors (STUN), that scales well to large numbers of sensors and moving objects by using hierarchy. We also describe a method, called drain-and-balance (DAB), for building efficient tracking… (More)