Sciweavers

2424 search results - page 328 / 485
» A general algorithm for data dependence analysis
Sort
View
129
Voted
SIGCOMM
2009
ACM
15 years 10 months ago
Optimizing the BSD routing system for parallel processing
The routing architecture of the original 4.4BSD [3] kernel has been deployed successfully without major design modification for over 15 years. In the unified routing architectur...
Qing Li, Kip Macy
129
Voted
PVLDB
2010
112views more  PVLDB 2010»
15 years 2 months ago
Two-way Replacement Selection
The performance of external sorting using merge sort is highly dependent on the length of the runs generated. One of the most commonly used run generation strategies is Replacemen...
Xavier Martinez-Palau, David Dominguez-Sal, Josep-...
118
Voted
TMC
2010
141views more  TMC 2010»
15 years 2 months ago
Energy-Optimal Scheduling with Dynamic Channel Acquisition in Wireless Downlinks
—We consider a wireless base station serving L users through L time-varying channels. It is well known that opportunistic scheduling algorithms with full channel state informatio...
Chih-Ping Li, Michael J. Neely
154
Voted
BMCBI
2011
14 years 10 months ago
easyDAS: Automatic creation of DAS servers
Background: The Distributed Annotation System (DAS) has proven to be a successful way to publish and share biological data. Although there are more than 750 active registered serv...
Bernat Gel, Andrew M. Jenkinson, Rafael C. Jimenez...
117
Voted
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 7 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra