Sciweavers

1132 search results - page 34 / 227
» Similarity Graphs
Sort
View
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
MVA
1994
15 years 7 months ago
A High Level Merging Tool in Image Segmentation Applications
This paper deals with "on the fly" segmentation on sliding images. We describe a quality control industrial application for which that type of image analysis is an elega...
Philippe Charnier, Ehoud Ahronovitz, Christophe Fi...
ICML
2007
IEEE
16 years 7 months ago
Learning from interpretations: a rooted kernel for ordered hypergraphs
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...
Gabriel Wachman, Roni Khardon
SCIA
2009
Springer
146views Image Analysis» more  SCIA 2009»
16 years 1 months ago
Extraction of Windows in Facade Using Kernel on Graph of Contours
In the past few years, street-level geoviewers has become a very popular web-application. In this paper, we focus on a first urban concept which has been identified as useful for...
Jean-Emmanuel Haugeard, Sylvie Philipp-Foliguet, F...
CORR
2004
Springer
117views Education» more  CORR 2004»
15 years 6 months ago
Traffic-driven model of the World Wide Web graph
We propose a model for the World Wide Web graph that couples the topological growth with the traffic's dynamical evolution. The model is based on a simple traffic-driven dynam...
Alain Barrat, Marc Barthelemy, Alessandro Vespigna...