Sciweavers

991 search results - page 93 / 199
» The query-flow graph: model and applications
Sort
View
SCAM
2007
IEEE
14 years 5 months ago
On Temporal Path Conditions in Dependence Graphs
Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express mo...
Andreas Lochbihler, Gregor Snelting
SPIRE
2005
Springer
14 years 4 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
14 years 9 days ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
ICPR
2002
IEEE
15 years 14 hour ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...
MFCS
2009
Springer
14 years 5 months ago
Balanced Paths in Colored Graphs
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
Alessandro Bianco, Marco Faella, Fabio Mogavero, A...