Sciweavers

170 search results - page 31 / 34
» On Metro-Line Crossing Minimization
Sort
View
BICOB
2009
Springer
15 years 11 months ago
Generalized Binary Tanglegrams: Algorithms and Applications
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eule...
EUROPAR
2009
Springer
15 years 11 months ago
Uniform Sampling for Directed P2P Networks
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
Cyrus P. Hall, Antonio Carzaniga
DSN
2006
IEEE
15 years 11 months ago
CADRE: Cycle-Accurate Deterministic Replay for Hardware Debugging
One of the main reasons for the difficulty of hardware verification is that hardware platforms are typically nondeterministic at clock-cycle granularity. Uninitialized state ele...
Smruti R. Sarangi, Brian Greskamp, Josep Torrellas
INFOVIS
2005
IEEE
15 years 10 months ago
Flow Map Layout
Cartographers have long used flow maps to show the movement of objects from one location to another, such as the number of people in a migration, the amount of goods being traded,...
Doantam Phan, Ling Xiao, Ron B. Yeh, Pat Hanrahan,...
IPPS
2005
IEEE
15 years 10 months ago
Optimal Oblivious Path Selection on the Mesh
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
Costas Busch, Malik Magdon-Ismail, Jing Xi