Sciweavers

2004 search results - page 343 / 401
» Sampling from large graphs
Sort
View
IV
2010
IEEE
196views Visualization» more  IV 2010»
13 years 8 months ago
3D Edge Bundling for Geographical Data Visualization
Visualization of graphs containing many nodes and edges efficiently is quite challenging since representations generally suffer from visual clutter induced by the large amount of...
Antoine Lambert, Romain Bourqui, David Auber
JMLR
2010
115views more  JMLR 2010»
13 years 8 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
PAMI
2010
112views more  PAMI 2010»
13 years 8 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
TON
2010
109views more  TON 2010»
13 years 8 months ago
Rendered path: range-free localization in anisotropic sensor networks with holes
Sensor positioning is a crucial part of many location-dependent applications that utilize wireless sensor networks (WSNs). Current localization approaches can be divided into two ...
Mo Li, Yunhao Liu
SRDS
2010
IEEE
13 years 7 months ago
Invariants Based Failure Diagnosis in Distributed Computing Systems
This paper presents an instance based approach to diagnosing failures in computing systems. Owing to the fact that a large portion of occurred failures are repeated ones, our meth...
Haifeng Chen, Guofei Jiang, Kenji Yoshihira, Akhil...