Sciweavers

3131 search results - page 261 / 627
» Generalized connection caching
Sort
View
SPAA
2003
ACM
15 years 12 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
IPPS
1996
IEEE
15 years 10 months ago
Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study
This paper presents e cient and portable implementations of a useful image enhancement process, the Symmetric Neighborhood Filter SNF, and an image segmentation technique which ma...
David A. Bader, Joseph JáJá, David H...
FMCAD
2008
Springer
15 years 8 months ago
Automatic Non-Interference Lemmas for Parameterized Model Checking
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
Jesse D. Bingham
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 6 months ago
Distributed Storage Codes Meet Multiple-Access Wiretap Channels
We consider i) the overhead minimization of maximum-distance seperable (MDS) storage codes for the repair of a single failed node and ii) the total secure degrees-of-freedom (S-DoF...
Dimitris S. Papailiopoulos, Alexandros G. Dimakis
CORR
2006
Springer
103views Education» more  CORR 2006»
15 years 6 months ago
AS Relationships: Inference and Validation
Research on performance, robustness, and evolution of the global Internet is fundamentally handicapped without accurate and thorough knowledge of the nature and structure of the c...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, M...