Sciweavers

4940 search results - page 955 / 988
» On the Complexity of Universal Programs
Sort
View
COMPGEOM
2003
ACM
14 years 3 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
ICAIL
2003
ACM
14 years 3 months ago
Improving Legal Quality - an application report
Problems with legal quality will not only increase effort and costs of the law enforcement organisations, but also undermines the regulating power of the legislator. Unintended us...
Tom M. van Engers, Margherita R. Boekenoogen
SACMAT
2003
ACM
14 years 3 months ago
On context in authorization policy
Authorization policy infrastructures are evolving with the complex environments that they support. However, the requirements and technologies supporting context are not yet well u...
Patrick Drew McDaniel
SIGMETRICS
2003
ACM
129views Hardware» more  SIGMETRICS 2003»
14 years 3 months ago
Run-time modeling and estimation of operating system power consumption
The increasing constraints on power consumption in many computing systems point to the need for power modeling and estimation for all components of a system. The Operating System ...
Tao Li, Lizy Kurian John
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
14 years 3 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...