Sciweavers

4761 search results - page 884 / 953
» Generalizing Boundary Points
Sort
View
SIGMETRICS
2004
ACM
124views Hardware» more  SIGMETRICS 2004»
14 years 2 months ago
Interposed proportional sharing for a storage service utility
This paper develops and evaluates new share-based scheduling algorithms for differentiated service quality in network services, such as network storage servers. This form of resou...
Wei Jin, Jeffrey S. Chase, Jasleen Kaur
WMASH
2004
ACM
14 years 2 months ago
LOCATOR: location estimation system For wireless LANs
With the wide spread growth of mobile computing devices and local area wireless networks, wireless network providers have started to target the users with value-added services bas...
Ankur Agiwal, Parakram Khandpur, Huzur Saran
CCS
2004
ACM
14 years 2 months ago
On the effectiveness of address-space randomization
Address-space randomization is a technique used to fortify systems against bu er over ow attacks. The idea is to introduce arti cial diversity by randomizing the memory location o...
Hovav Shacham, Matthew Page, Ben Pfaff, Eu-Jin Goh...
ESOP
2004
Springer
14 years 2 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn
ICALP
2004
Springer
14 years 2 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee