1133 search results - page 147 / 227 » Basics of Graph Cuts |
SRDS
2010
IEEE
14 years 7 months 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...
CIKM
2011
Springer
13 years 9 months ago
2011
Springer
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
AGP
1995
IEEE
15 years 1 months ago
1995
IEEE
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
SIGMETRICS
2003
ACM
15 years 3 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
DAM
2007
14 years 9 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...