Sciweavers

1528 search results - page 62 / 306
» On Signatures for Communication Graphs
Sort
View
DAC
2001
ACM
14 years 8 months ago
Publicly Detectable Techniques for the Protection of Virtual Components
Highlighted with the newly released intellectual property (IP) protection white paper by VSI Alliance, the protection of virtual components (VCs) has received a large amount of at...
Gang Qu
VISUALIZATION
1997
IEEE
13 years 12 months ago
The contour spectrum
We introduce the contour spectrum, a user interface component that improves qualitative user interaction and provides real-time exact quanti cation in the visualization of isocont...
Chandrajit L. Bajaj, Valerio Pascucci, Daniel Schi...
CIAC
2006
Springer
100views Algorithms» more  CIAC 2006»
13 years 11 months ago
Distributed Approximation Algorithms for Planar Graphs
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...
JGAA
2006
127views more  JGAA 2006»
13 years 7 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
GLOBECOM
2010
IEEE
13 years 5 months ago
Circulant-Graph-Based Fault-Tolerant Routing for All-Optical WDM LANs
High demands in data delivery latency and communication reliability encourage the use of fault-toleranceenhanced all-optical WDM networks. Low latency is satisfied by setting up a ...
Dexiang Wang, Janise McNair