5052 search results - page 1010 / 1011 » On the Complexity of Ordered Colorings |
ESORICS
2012
Springer
11 years 9 months ago
2012
Springer
Abstract. Given the requirements of fast processing and the complexity of RF ranging systems, distance bounding protocols have been challenging to implement so far; only few design...
STOC
2009
ACM
14 years 7 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
EUROSYS
2007
ACM
14 years 3 months ago
2007
ACM
Data centers are often under-utilized due to over-provisioning as well as time-varying resource demands of typical enterprise applications. One approach to increase resource utili...
ISPA
2005
Springer
14 years 4 days ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
DRUMS
1998
Springer
13 years 11 months ago
1998
Springer
Autonomous robots need the ability to move purposefully and without human intervention in real-world environments that have not been speci cally engineered for them. These environm...