4074 search results - page 703 / 815 » Defining Computational Aesthetics |
STOC
2006
ACM
14 years 11 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
OSDI
2008
ACM
14 years 11 months ago
2008
ACM
The increasing use of computers for saving valuable data imposes stringent reliability constraints on storage systems. Reliability improvement via use of redundancy is a common pr...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
ICDE
2010
IEEE
14 years 11 months ago
2010
IEEE
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
PERCOM
2004
ACM
14 years 10 months ago
2004
ACM
With the advent of tiny networked devices, Mark Weiser's vision of a world embedded with invisible computers is coming to age. Due to their small size and relative ease of dep...