Sciweavers

7129 search results - page 892 / 1426
» Approximation Algorithms for Treewidth
Sort
View
CN
2002
88views more  CN 2002»
15 years 4 months ago
Rate allocation and buffer management for differentiated services
A novel algorithm for buffer management and rate allocation is presented for providing loss and delay differentiation for traffic classes at a network router. The algorithm, calle...
Jörg Liebeherr, Nicolas Christin
142
Voted
SIGIR
2002
ACM
15 years 4 months ago
PageRank, HITS and a unified framework for link analysis
Two popular webpage ranking algorithms are HITS and PageRank. HITS emphasizes mutual reinforcement between authority and hub webpages, while PageRank emphasizes hyperlink weight n...
Chris H. Q. Ding, Xiaofeng He, Parry Husbands, Hon...
156
Voted
TVCG
1998
121views more  TVCG 1998»
15 years 4 months ago
Interactive Volume Navigation
—Volume navigation is the interactive exploration of volume data sets by “flying” the viewpoint through the data, producing a volume rendered view at each frame. We present a...
Martin L. Brady, Kenneth K. Jung, H. T. Nguyen, Th...
130
Voted
RAS
2008
124views more  RAS 2008»
15 years 4 months ago
On redundancy, efficiency, and robustness in coverage for multiple robots
Motivated by potential efficiency and robustness gains, there is growing interest in the use of multiple robots for coverage. In coverage, robots visit every point in a target are...
Noam Hazon, Gal A. Kaminka
TAMC
2010
Springer
15 years 3 months ago
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
Pinar Heggernes, Daniel Meister, Udi Rotics