Sciweavers

5580 search results - page 34 / 1116
» Randomized priority algorithms
Sort
View
ICPR
2004
IEEE
15 years 9 days ago
Prioritized Region of Interest Coding in JPEG2000
A method is proposed to encode multiple regions of interest in the JPEG2000 image-coding framework. The algorithm is based on the rearrangement of packets in the code-stream to pl...
Victor Sanchez, Anup Basu, Mrinal K. Mandal
SIGMETRICS
2004
ACM
115views Hardware» more  SIGMETRICS 2004»
14 years 4 months ago
Emulating low-priority transport at the application layer: a background transfer service
Low priority data transfer across the wide area is useful in several contexts, for example for the dissemination of large files such as OS updates, content distribution or prefet...
Peter B. Key, Laurent Massoulié, Bing Wang
INFOCOM
2002
IEEE
14 years 4 months ago
Travelling Miser Problem
— Various monitoring and performance evaluation tools generate considerable amount of low priority traffic. This information is not always needed in real time, and thus could of...
Yuval Shavitt, David Breitgand, Danny Raz
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
12 years 1 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun
IPPS
1998
IEEE
14 years 3 months ago
A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
Benjamin S. Macey, Albert Y. Zomaya