Sciweavers

557 search results - page 92 / 112
» Optimization Algorithms for Large Self-Structuring Networks
Sort
View
SIGMETRICS
2004
ACM
115views Hardware» more  SIGMETRICS 2004»
14 years 3 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
IMC
2003
ACM
14 years 3 months ago
Virtual landmarks for the internet
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
Liying Tang, Mark Crovella
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
14 years 5 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
PLDI
2006
ACM
14 years 4 months ago
A global progressive register allocator
This paper describes a global progressive register allocator, a register allocator that uses an expressive model of the register allocation problem to quickly find a good allocat...
David Ryan Koes, Seth Copen Goldstein
TWC
2011
245views more  TWC 2011»
13 years 5 months ago
Cooperative Filter-and-Forward Beamforming for Frequency-Selective Channels with Equalization
Most of the existing literature on cooperative relay networks has focused on frequency– nonselective channels or frequency–selective channels with multi–carrier transmission...
Yang-wen Liang, Aïssa Ikhlef, Wolfgang H. Ger...