Sciweavers

2294 search results - page 142 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
CORR
2007
Springer
104views Education» more  CORR 2007»
14 years 10 months ago
Double Clustering and Graph Navigability
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
Oskar Sandberg
ICAI
2010
14 years 8 months ago
Exact Loopy Belief Propagation on Euler Graphs
Belief propagation is widely used in inference of graphical models. It yields exact solutions when the underlying graph is singly connected. When the graph contains loops, double-c...
Chen-Hsiang Yeang
CVPR
2010
IEEE
1171views Computer Vision» more  CVPR 2010»
15 years 6 months ago
Geodesic Star Convexity for Interactive Image Segmentation
In this paper we introduce a new shape constraint for interactive image segmentation. It is an extension of Veksler's star-convexity prior, in two ways: from a single star to ...
Varun Gulshan, Carsten Rother, Antonio Criminisi, ...
PVLDB
2010
122views more  PVLDB 2010»
14 years 8 months ago
On Graph Query Optimization in Large Networks
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
Peixiang Zhao, Jiawei Han
SSD
1997
Springer
140views Database» more  SSD 1997»
15 years 2 months ago
Spatial Data Mining: A Database Approach
Abstract. Knowledge discovery in databases (KDD) is an important task in spatial databases since both, the number and the size of such databases are rapidly growing. This paper int...
Martin Ester, Hans-Peter Kriegel, Jörg Sander