Sciweavers

15 search results - page 3 / 3
» Planar Point Location in Sublogarithmic Time
Sort
View
ICPP
1991
IEEE
13 years 11 months ago
Emulation of a PRAM on Leveled Networks
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...
Michael A. Palis, Sanguthevar Rajasekaran, David S...
IPPS
1999
IEEE
13 years 11 months ago
High Speed, High Capacity Bused Interconnects using Optical Slab Waveguides
In this paper we consider the use of optical slab waveguides as buses in a parallel computing environment. We show that slab buses can connect to many more elements than convention...
Martin Feldman, Ramachandran Vaidyanathan, Ahmed E...
CDC
2009
IEEE
132views Control Systems» more  CDC 2009»
14 years 5 days ago
Optimal sensor placement for time difference of arrival localization
— This paper addresses the problem of localizing a source from noisy time-of-arrival measurements. In particular, we are interested in the optimal placement of M planar sensors s...
Jason T. Isaacs, Daniel J. Klein, João Pedr...
COMPGEOM
1994
ACM
13 years 11 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
VLDB
2008
ACM
103views Database» more  VLDB 2008»
14 years 7 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...