Sciweavers

1986 search results - page 350 / 398
» Path Separability of Graphs
Sort
View
DSN
2009
IEEE
13 years 11 months ago
Precise request tracing and performance debugging for multi-tier services of black boxes
As more and more multi-tier services are developed from commercial components or heterogeneous middleware without the source code available, both developers and administrators nee...
Zhihong Zhang, Jianfeng Zhan, Yong Li, Lei Wang, D...
AAAI
2007
13 years 10 months ago
Conservative Dual Consistency
Consistencies are properties of Constraint Networks (CNs) that can be exploited in order to make inferences. When a significant amount of such inferences can be performed, CNs ar...
Christophe Lecoutre, Stéphane Cardon, Julie...
ALT
2010
Springer
13 years 9 months ago
Inferring Social Networks from Outbreaks
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
Dana Angluin, James Aspnes, Lev Reyzin
IPCO
2010
148views Optimization» more  IPCO 2010»
13 years 9 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...
IADIS
2008
13 years 9 months ago
Data Mining In Non-Stationary Multidimensional Time Series Using A Rule Similarity Measure
Time series analysis is a wide area of knowledge that studies processes in their evolution. The classical research in the area tends to find global laws underlying the behaviour o...
Nikolay V. Filipenkov