Sciweavers

4037 search results - page 61 / 808
» Routing without ordering
Sort
View
GD
2003
Springer
14 years 2 months ago
Radial Level Planarity Testing and Embedding in Linear Time
A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...
Christian Bachmaier, Franz-Josef Brandenburg, Mich...
TC
1998
13 years 8 months ago
Regular Sparse Crossbar Concentrators
A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n ≥ m inputs to its m outputs possibly without the ability to distingui...
Weiming Guo, A. Yavuz Oruç
CCGRID
2004
IEEE
14 years 22 days ago
Routing and resource discovery in Phoenix Grid-enabled message passing library
We describe design and implementation of a "Gridenabled" message passing library, in the context of Phoenix message passing model. It supports (1) message routing betwee...
Kenji Kaneda, Kenjiro Taura, Akinori Yonezawa
ENTCS
2008
390views more  ENTCS 2008»
13 years 7 months ago
Cryptographic Versus Trust-based Methods for MANET Routing Security
Mobile Ad-hoc Networks (MANETs) allow wireless nodes to form a network without requiring a fixed infrastructure. Early routing protocols for MANETs failed to take security issues ...
Jared Cordasco, Susanne Wetzel
FPGA
2005
ACM
90views FPGA» more  FPGA 2005»
14 years 2 months ago
Using bus-based connections to improve field-programmable gate array density for implementing datapath circuits
Abstract—As the logic capacity of field-programmable gate arrays (FPGAs) increases, they are increasingly being used to implement large arithmetic-intensive applications, which ...
Andy Gean Ye, Jonathan Rose