Sciweavers

4233 search results - page 343 / 847
» Three Paths to Effectiveness
Sort
View
TMC
2011
158views more  TMC 2011»
15 years 1 months ago
Explicit Congestion Control Algorithms for Time Varying Capacity Media
—Explicit congestion control (XCC) is emerging as one potential solution for overcoming limitations inherent to the current TCP algorithm, characterized by unstable throughput, h...
Filipe Abrantes, João Taveira Araujo, Manue...
IWOCA
2010
Springer
232views Algorithms» more  IWOCA 2010»
15 years 1 months ago
Computing Role Assignments of Proper Interval Graphs in Polynomial Time
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
Pinar Heggernes, Pim van 't Hof, Daniël Paulu...
TC
2010
15 years 1 months ago
Performance Comparison of Graphics Processors to Reconfigurable Logic: A Case Study
A systematic approach to the comparison of the graphics processor (GPU) and reconfigurable logic is defined in terms of three throughput drivers. The approach is applied to five ca...
Ben Cope, Peter Y. K. Cheung, Wayne Luk, Lee W. Ho...
ICASSP
2011
IEEE
14 years 10 months ago
Time prediction of non flat fading channels
In this paper three different techniques to predict the channel transfer functions of non flat fading channels in multiple antenna systems are investigated. The prediction is don...
Nico Palleit, Tobias Weber
CHI
2011
ACM
14 years 10 months ago
TorusDesktop: pointing via the backdoor is sometimes shorter
When pointing to a target on a computer desktop, we may think we are taking the shortest possible path. But new shortcuts become possible if we allow the mouse cursor to jump from...
Stéphane Huot, Olivier Chapuis, Pierre Drag...