Sciweavers

1480 search results - page 66 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Sparse Gaussian graphical models with unknown block structure
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Benjamin M. Marlin, Kevin P. Murphy
SIGIR
2005
ACM
14 years 1 months ago
Exploiting the hierarchical structure for link analysis
Link analysis algorithms have been extensively used in Web information retrieval. However, current link analysis algorithms generally work on a flat link graph, ignoring the hiera...
Gui-Rong Xue, Qiang Yang, Hua-Jun Zeng, Yong Yu, Z...
ICASSP
2010
IEEE
13 years 7 months ago
Consensus in correlated random topologies: Weights for finite time horizon
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...
Dusan Jakovetic, João Xavier, José M...
DIAGRAMS
2006
Springer
13 years 11 months ago
Exploring the Effect of Animation and Progressive Revealing on Diagrammatic Problem Solving
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...
Daesub Yoon, N. Hari Narayanan, SooCheol Lee, Oh-C...
JDA
2007
97views more  JDA 2007»
13 years 7 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia