21324 search results - page 321 / 4265 » Making the case for computing |
156
Voted
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
Due to the limited amounts of on-chip memory, large volumes of data, and performance and power consumption overhead associated with interprocessor communication, efficient managem...
138
click to vote
MST
2002
15 years 4 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
141
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
An important problem in data mining is detecting changes in large data sets. Although there are a variety of change detection algorithms that have been developed, in practice it c...
149
click to vote
RTCSA
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—Although energy-efficient real-time task scheduling has attracted a lot of attention in the past decade, most existing results assumed deterministic execution lengths f...
146
Voted
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...