21324 search results - page 561 / 4265 » Making the case for computing |
215
click to vote
CIKM
2006
Springer
15 years 11 months ago
2006
Springer
Skyline queries compute the set of Pareto-optimal tuples in a relation, i.e., those tuples that are not dominated by any other tuple in the same relation. Although several algorit...
177
click to vote
ACSD
2006
IEEE
15 years 9 months ago
2006
IEEE
Networks on chip platforms offer the opportunity to introduce a new abstraction level that defines a set of platform services with performance and power characteristics. By making...
227
click to vote
DBSEC
2008
15 years 8 months ago
2008
Pervasive computing applications typically involve cooperation among a number of entities spanning multiple organizations. Any security breach in any single entity can have very fa...
227
click to vote
DAC
2010
ACM
15 years 7 months ago
2010
ACM
Many DTM schemes rely heavily on the accurate knowledge of the chip's dynamic thermal state to make optimal performance/ temperature trade-off decisions. This information is ...
183
click to vote
ALGORITHMICA
2010
15 years 7 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...