Sciweavers

2695 search results - page 104 / 539
» Learning Graph Matching
Sort
View
134
Voted
ICML
2009
IEEE
16 years 3 months ago
Spectral clustering based on the graph p-Laplacian
We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvecto...
Matthias Hein, Thomas Bühler
118
Voted
AIED
2009
Springer
15 years 9 months ago
I learn from you, you learn from me: How to make iList learn from students
We developed a new model for iList, our system that helps students learn linked list. The model is automatically extracted from past student data, and allows iList to track student...
Davide Fossati, Barbara Di Eugenio, Stellan Ohlsso...
ICIP
2006
IEEE
16 years 4 months ago
Virtual Craniofacial Reconstruction from Computed Tomography Image Sequences Exhibiting Multiple Fractures
A novel procedure for in-silico (virtual) craniofacial reconstruction of human mandibles with multiple fractures from a sequence of Computed Tomography (CT) images is presented. T...
Ananda S. Chowdhury, Suchendra M. Bhandarkar, Robe...
JCT
2007
93views more  JCT 2007»
15 years 2 months ago
Generating bricks
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that...
Serguei Norine, Robin Thomas
EDOC
2009
IEEE
15 years 6 months ago
Aligning Business Process Models
This paper studies the following problem: given a pair of business process models, determine which elements in one model are related to which elements in the other model. This prob...
Remco M. Dijkman, Marlon Dumas, Luciano Garc&iacut...