Sciweavers

475 search results - page 44 / 95
» Z3-Connectivity with Independent Number 2
Sort
View
WWW
2001
ACM
14 years 10 months ago
A metro map metaphor for guided tours on the Web: the Webvise guided tour system
This paper presents a guided tour system for the WWW. It is a module for the Webvise open hypermedia system that implements the ideas of trails and guided tours, originating from ...
Elmer Sandvad, Kaj Grønbæk, Lennert S...
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
14 years 10 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
HPCA
2005
IEEE
14 years 10 months ago
A Performance Comparison of DRAM Memory System Optimizations for SMT Processors
Memory system optimizations have been well studied on single-threaded systems; however, the wide use of simultaneous multithreading (SMT) techniques raises questions over their ef...
Zhichun Zhu, Zhao Zhang
INFOCOM
2009
IEEE
14 years 4 months ago
Interference-Resilient Information Exchange
—This paper presents an efficient protocol to reliably exchange information in a single-hop radio network with unpredictable interference. The devices can access C communication...
Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalsk...
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
14 years 4 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody