417 search results - page 64 / 84 » Constructing Call Multigraphs Using Dependence Graphs |
SRDS
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper presents an instance based approach to diagnosing failures in computing systems. Owing to the fact that a large portion of occurred failures are repeated ones, our meth...
GD
2007
Springer
14 years 1 months ago
2007
Springer
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
NIPS
2008
13 years 8 months ago
2008
Abstract: Structure learning of dynamic Bayesian networks provide a principled mechanism for identifying conditional dependencies in time-series data. This learning procedure assum...
MP
2010
13 years 5 months ago
2010
In this paper, we introduce an operation that creates families of facet-defining inequalities for highdimensional infinite group problems using facet-defining inequalities of l...
CAISE
2009
Springer
13 years 10 months ago
2009
Springer
Just like web services, business processes can be stored in public repositories to be shared and used by third parties, e.g., as building blocks for constructing new business proce...