112 search results - page 12 / 23 » Neighborhood based fast graph search in large networks |
HM
2007
Springer
15 years 3 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
AI
2008
Springer
14 years 9 months ago
2008
Springer
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...
BIBM
2008
IEEE
15 years 4 months ago
2008
IEEE
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
117
click to vote
FAST
2004
14 years 11 months ago
2004
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...