202 search results - page 17 / 41 » Performance-Driven Partitioning Using a Replication Graph Ap... |
UAI
2003
13 years 8 months ago
2003
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
JMLR
2010
13 years 2 months ago
2010
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
EPEW
2005
Springer
14 years 1 months ago
2005
Springer
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object'...