Sciweavers

2962 search results - page 63 / 593
» Optimizing Spatial Data Structures For Static Data
Sort
View
CDC
2008
IEEE
115views Control Systems» more  CDC 2008»
14 years 3 months ago
Continuous path planning for a data harvesting mobile server
— We consider a queueing system composed of queues distributed at fixed locations in a continuous environment and a mobile server serving the jobs in the queues with spatially v...
Jerome Le Ny, Munther A. Dahleh, Eric Feron, Emili...
SPAA
2010
ACM
13 years 9 months ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
CORR
2007
Springer
63views Education» more  CORR 2007»
13 years 9 months ago
Optimizing the SINR operating point of spatial networks
— This paper addresses the following question, which is of interest in the design and deployment of a multiuser decentralized network. Given a total system bandwidth of W Hz and ...
Nihar Jindal, Jeffrey G. Andrews, Steven Weber
TIC
2000
Springer
174views System Software» more  TIC 2000»
14 years 16 days ago
Alias Types for Recursive Data Structures
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
David Walker, J. Gregory Morrisett
WADS
1997
Springer
108views Algorithms» more  WADS 1997»
14 years 1 months ago
Dynamic Data Structures for Fat Objects and Their Applications
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha ...