Sciweavers

3220 search results - page 159 / 644
» Constrained Graph Processes
Sort
View
GBRPR
2007
Springer
15 years 8 months ago
A New Contour Filling Algorithm Based on 2D Topological Map
Abstract. In this paper, we present a topological algorithm which allows to ll contours images. The lling problem has been widely treated and it recently appeared that it can alw...
Guillaume Damiand, Denis Arrivault
87
Voted
IHM
2006
ACM
15 years 8 months ago
ExploraGraph et la personnalisation des interactions pour l'apprentissage
This paper describes how the different dimensions of personalization can be integrated in an environment designed to support learning. We show how the ExploraGraph environment int...
Aude Dufresne, Sandrine PromTep
128
Voted
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
15 years 8 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
112
Voted
ALENEX
2007
105views Algorithms» more  ALENEX 2007»
15 years 4 months ago
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
Martin Kutz, Pascal Schweitzer
106
Voted
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 9 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen