Sciweavers

2254 search results - page 106 / 451
» Computing the minimal covering set
Sort
View
119
Voted
NETWORKS
2007
15 years 7 days ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
112
Voted
IMC
2010
ACM
14 years 10 months ago
Selecting representative IP addresses for internet topology studies
An Internet hitlist is a set of addresses that cover and can represent the the Internet as a whole. Hitlists have long been used in studies of Internet topology, reachability, and...
Xun Fan, John Heidemann
ICLP
1997
Springer
15 years 4 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
TIP
2010
277views more  TIP 2010»
14 years 7 months ago
Distance Regularized Level Set Evolution and Its Application to Image Segmentation
Level set methods have been widely used in image processing and computer vision. In conventional level set formulations, the level set function typically develops irregularities du...
Chunming Li, Chenyang Xu, Changfeng Gui, Martin D....
136
Voted
ISSRE
2003
IEEE
15 years 6 months ago
Augmenting Simulated Annealing to Build Interaction Test Suites
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
Myra B. Cohen, Charles J. Colbourn, Alan C. H. Lin...