Sciweavers

529 search results - page 105 / 106
» ideas 2003
Sort
View
ISCAPDCS
2003
13 years 7 months ago
N-Tuple Compression: A Novel Method for Compression of Branch Instruction Traces
Branch predictors and processor front-ends have been the focus of a number of computer architecture studies. Typically they are evaluated separately from other components using tr...
Aleksandar Milenkovic, Milena Milenkovic, Jeffrey ...
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
13 years 7 months ago
Faster approximation algorithms for the minimum latency problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, David P. Williamson
COMCOM
2008
80views more  COMCOM 2008»
13 years 5 months ago
Robust video-on-demand streaming in peer-to-peer environments
This paper presents a new video-on-demand streaming technique in peer-to-peer (P2P) environments. While a number of P2P live video streaming techniques have been proposed in the p...
Tai T. Do, Kien A. Hua, Mounir A. Tantaoui
ADHOC
2005
139views more  ADHOC 2005»
13 years 5 months ago
Improving TCP performance in ad hoc networks using signal strength based link management
Mobility in ad hoc networks causes frequent link failures, which in turn causes packet losses. TCP attributes these packet losses to congestion. This incorrect inference results i...
Fabius Klemm, Zhenqiang Ye, Srikanth V. Krishnamur...
JZUSC
2010
129views more  JZUSC 2010»
13 years 4 months ago
Representing conics by low degree rational DP curves
: A DP curve is a new kind of parametric curve defined by Delgado and Peña (2003); it has very good properties when used in both geometry and algebra, i.e., it is shape preserving...
Qian-qian Hu, Guo-jin Wang