694 search results - page 61 / 139 » Open Graphs and Computational Reasoning |
TSE
2010
13 years 8 months ago
2010
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
EMMCVPR
2007
Springer
14 years 4 months ago
2007
Springer
Most of the traditional methods for shape classification are based on contour. They often encounter difficulties when dealing with classes that have large nonlinear variability, es...
ICALP
2007
Springer
14 years 4 months ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
GD
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
EDBT
2012
ACM
12 years 18 days ago
2012
ACM
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...