Sciweavers

2304 search results - page 358 / 461
» On the Vulnerability of Large Graphs
Sort
View
AI
2011
Springer
14 years 5 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
VCBM
2010
14 years 4 months ago
A General Approach to Model Biomedical Data from 3D Unorganised Point Clouds with Medial Scaffolds
We present the latest developments in modeling 3D biomedical data via the Medial Scaffold (MS), a 3D acyclic oriented graph representation of the Medial Axis (MA) [LK07, SP08]. Th...
Frederic F. Leymarie, Ming-Ching Chang, Celina Imi...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 11 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
114
Voted
CIVR
2007
Springer
192views Image Analysis» more  CIVR 2007»
15 years 4 months ago
Texture retrieval based on a non-parametric measure for multivariate distributions
In the present study, an efficient strategy for retrieving texture images from large texture databases is introduced and studied within a distributional-statistical framework. Our...
Vasileios K. Pothos, Christos Theoharatos, George ...
ICPP
2006
IEEE
15 years 4 months ago
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
David A. Bader, Kamesh Madduri