Sciweavers

8917 search results - page 1592 / 1784
» Abstraction in Algorithm Animation
Sort
View
JEI
2007
91views more  JEI 2007»
15 years 3 months ago
Gradient-based value mapping for pseudocolor images
Abstract. We develop a method for automatic colorization of images (or two-dimensional fields) in order to visualize pixel values and their local differences. In many applications...
Arvind Visvanathan, Stephen E. Reichenbach, Qingpi...
JGAA
2007
87views more  JGAA 2007»
15 years 3 months ago
A 2.5D Hierarchical Drawing of Directed Graphs
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...
Seok-Hee Hong, Nikola S. Nikolov, Alexandre Tarass...
125
Voted
TON
2008
99views more  TON 2008»
15 years 3 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
TON
2008
100views more  TON 2008»
15 years 3 months ago
Impact of hot-potato routing changes in IP networks
Abstract-- Despite the architectural separation between intradomain and interdomain routing in the Internet, intradomain protocols do influence the path-selection process in the Bo...
Renata Teixeira, Aman Shaikh, Timothy G. Griffin, ...
TOPNOC
2008
15 years 3 months ago
McMillan's Complete Prefix for Contextual Nets
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...
Paolo Baldan, Andrea Corradini, Barbara König...
« Prev « First page 1592 / 1784 Last » Next »