554 search results - page 59 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
SC
2005
ACM
14 years 2 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...
CLUSTER
2002
IEEE
13 years 8 months ago
2002
IEEE
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
ACIVS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In the pattern recognition context, objects can be represented as graphs with attributed nodes and edges involving their relations. Consequently, matching attributed grap...
TAMC
2010
Springer
14 years 1 months ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
SWAT
1998
Springer
14 years 27 days ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...