Sciweavers

750 search results - page 73 / 150
» Reconstruction for Models on Random Graphs
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 12 days ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
ECML
2004
Springer
15 years 5 months ago
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Marco Saerens, François Fouss, Luh Yen, Pie...
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
15 years 1 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
ICML
2010
IEEE
15 years 28 days ago
Learning Temporal Causal Graphs for Relational Time-Series Analysis
Learning temporal causal graph structures from multivariate time-series data reveals important dependency relationships between current observations and histories, and provides a ...
Yan Liu 0002, Alexandru Niculescu-Mizil, Aurelie C...
JEI
2006
109views more  JEI 2006»
14 years 12 months ago
Robotic three-dimensional imaging system for under-vehicle inspection
We present our research efforts toward the deployment of 3-D sensing technology to an under-vehicle inspection robot. The 3-D sensing modality provides flexibility with ambient lig...
Sreenivas R. Sukumar, David L. Page, Andrei V. Gri...