Sciweavers

429 search results - page 63 / 86
» Improved Algorithms for the k Maximum-Sums Problems
Sort
View
TWC
2008
152views more  TWC 2008»
14 years 9 months ago
Bandwidth-Guaranteed Fair Scheduling with Effective Excess Bandwidth Allocation for Wireless Networks
Traffic scheduling is key to the provision of quality of service (QoS) differentiation and guarantees in wireless networks. Unlike its wireline counterpart, wireless communications...
Yaxin Cao, Ka-Cheong Leung, Victor O. K. Li
PODC
2009
ACM
15 years 10 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 3 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
15 years 10 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
IWOCA
2009
Springer
117views Algorithms» more  IWOCA 2009»
15 years 2 months ago
On the Maximal Number of Cubic Subwords in a String
We investigate the problem of the maximum number of cubic subwords (of the form www) in a given word. We also consider square subwords (of the form ww). The problem of the maximum ...
Marcin Kubica, Jakub Radoszewski, Wojciech Rytter,...