Sciweavers

486 search results - page 30 / 98
» Parallel Algorithms for Relational Coarsest Partition Proble...
Sort
View
IJCAI
2003
13 years 9 months ago
Contract Algorithms and Robots on Rays: Unifying Two Scheduling Problems
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
Daniel S. Bernstein, Lev Finkelstein, Shlomo Zilbe...
EUROPAR
2007
Springer
14 years 1 months ago
Decision Trees and MPI Collective Algorithm Selection Problem
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
Jelena Pjesivac-Grbovic, George Bosilca, Graham E....
ICIP
2010
IEEE
13 years 5 months ago
Multi-stream partitioning and parity rate allocation for scalable IPTV delivery
We address the joint problem of clustering heterogenous clients and allocating scalable video source rate and FEC redundancy in IPTV systems. We propose a streaming solution that ...
Jacob Chakareski, Pascal Frossard
ICIP
2005
IEEE
14 years 9 months ago
Visual tracking using sequential importance sampling with a state partition technique
Sequential importance sampling (SIS), also known as particle filtering, has drawn increasing attention recently due to its superior performance in nonlinear and non-Gaussian dynam...
Yan Zhai, Mark B. Yeary, Joseph P. Havlicek, Jean-...
P2P
2007
IEEE
113views Communications» more  P2P 2007»
14 years 2 months ago
Handling Network Partitions and Mergers in Structured Overlay Networks
Structured overlay networks form a major class of peerto-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-s...
Tallat M. Shafaat, Ali Ghodsi, Seif Haridi