Sciweavers

417 search results - page 14 / 84
» Constructing Call Multigraphs Using Dependence Graphs
Sort
View
DAM
2010
92views more  DAM 2010»
13 years 8 months ago
Enumeration of matchings in families of self-similar graphs
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
Elmar Teufl, Stephan Wagner
EAAI
2007
135views more  EAAI 2007»
13 years 8 months ago
Automatic generation of explanations: AGE
Explaining how engineering devices work is important to students, engineers, and operators. In general, machine generated explanations have been produced from a particular perspec...
Silvia B. González-Brambila, Eduardo F. Mor...
SIGIR
2008
ACM
13 years 8 months ago
Query dependent ranking using K-nearest neighbor
Many ranking models have been proposed in information retrieval, and recently machine learning techniques have also been applied to ranking model construction. Most of the existin...
Xiubo Geng, Tie-Yan Liu, Tao Qin, Andrew Arnold, H...
PASTE
2010
ACM
14 years 1 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 8 months ago
Graph Laplacians and their convergence on random neighborhood graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...