1425 search results - page 60 / 285 » Beyond Dependency Graphs |
140
Voted
SRDS
2010
IEEE
15 years 18 days ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
121
Voted
COMPSAC
2009
IEEE
15 years 9 months ago
2009
IEEE
—This paper considers the task of software test case generation from a large space of values of input parameters. The purpose of the paper is to create a model of software input ...
111
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
138
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
111
click to vote
CIE
2010
Springer
15 years 7 months ago
2010
Springer
This paper discusses the use of spatial graph models for the analysis of networks that do not have a direct spatial reality, such as web graphs, on-line social networks, or citatio...