Sciweavers

6365 search results - page 1087 / 1273
» Fast Local Computation Algorithms
Sort
View
LCPC
2009
Springer
15 years 11 months ago
Using the Meeting Graph Framework to Minimise Kernel Loop Unrolling for Scheduled Loops
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
Mounira Bachir, David Gregg, Sid Ahmed Ali Touati
EUROPAR
2009
Springer
15 years 10 months ago
Surfing Peer-to-Peer IPTV: Distributed Channel Switching
It is now common for IPTV systems attracting millions of users to be based on a peer-to-peer (P2P) architecture. In such systems, each channel is typically associated with one P2P ...
Anne-Marie Kermarrec, Erwan Le Merrer, Yaning Liu,...
CASES
2003
ACM
15 years 10 months ago
A hierarchical approach for energy efficient application design using heterogeneous embedded systems
Several features such as reconfiguration, voltage and frequency scaling, low-power operating states, duty-cycling, etc. are exploited for latency and energy efficient application ...
Sumit Mohanty, Viktor K. Prasanna
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 8 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
JACM
2000
86views more  JACM 2000»
15 years 6 months ago
Periodification scheme: constructing sorting networks with constant period
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oes...
« Prev « First page 1087 / 1273 Last » Next »