Sciweavers

2463 search results - page 477 / 493
» Rankings of Directed Graphs
Sort
View
SIGCOMM
2004
ACM
15 years 10 months ago
Work-conserving distributed schedulers for Terabit routers
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...
Prashanth Pappu, Jonathan S. Turner, Kenneth Wong
ICCS
2004
Springer
15 years 10 months ago
Complex Network of Earthquakes
Complex Network of Earthquakes Sumiyoshi Abe Institute of Physics, University of Tsukuba Ibaraki 3058571, Japan First, a brief discussion is made about a relevance of nonextensive...
Sumiyoshi Abe, Norikazu Suzuki
ICWL
2004
Springer
15 years 10 months ago
Learning Algorithms with an Electronic Chalkboard over the Web
This paper describes a system for the animation of algorithms on an electronic chalkboard. The instructor teaching an algorithm can enter data directly through a drawing- the algor...
Margarita Esponda Argüero, Raúl Rojas
161
Voted
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
15 years 10 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
RT
2004
Springer
15 years 10 months ago
Bixels: Picture Samples with Sharp Embedded Boundaries
Pixels store a digital image as a grid of point samples that can reconstruct a limited-bandwidth continuous 2-D source image. Although convenient for anti-aliased display, these b...
Jack Tumblin, Prasun Choudhury