Sciweavers

1172 search results - page 220 / 235
» Path Algorithms on Regular Graphs
Sort
View
IPCO
2010
148views Optimization» more  IPCO 2010»
13 years 11 months ago
Prize-Collecting Steiner Network Problems
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
AMC
2006
100views more  AMC 2006»
13 years 9 months ago
Reliability evaluation of multi-component cold-standby redundant systems
A new methodology for the reliability evaluation of an l-dissimilar-unit non-repairable cold-standby redundant system is introduced in this paper. Each unit is composed of a numbe...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
JSAC
2006
111views more  JSAC 2006»
13 years 9 months ago
On trust models and trust evaluation metrics for ad hoc networks
Within the realm of network security, we interpret the concept of trust as a relation among entities that participate in various protocols. Trust relations are based on evidence cr...
George Theodorakopoulos, John S. Baras
TVCG
2008
112views more  TVCG 2008»
13 years 9 months ago
Vispedia: Interactive Visual Exploration of Wikipedia Data via Search-Based Integration
Abstract-Wikipedia is an example of the collaborative, semi-structured data sets emerging on the Web. These data sets have large, nonuniform schema that require costly data integra...
Bryan Chan, Leslie Wu, Justin Talbot, Mike Cammara...
CN
2004
114views more  CN 2004»
13 years 9 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford