Sciweavers

863 search results - page 132 / 173
» Links in edge-colored graphs
Sort
View
CAI
2002
Springer
13 years 7 months ago
Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks
In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth ...
Ivan Stojmenovic, Mark Russell, Bosko Vukojevic
IJCM
2002
92views more  IJCM 2002»
13 years 7 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
SIGIR
2002
ACM
13 years 7 months ago
Generic summarization and keyphrase extraction using mutual reinforcement principle and sentence clustering
A novel method for simultaneous keyphrase extraction and generic text summarization is proposed by modeling text documents as weighted undirected and weighted bipartite graphs. Sp...
Hongyuan Zha
IJBIDM
2010
80views more  IJBIDM 2010»
13 years 6 months ago
Practical algorithms for subgroup detection in covert networks
: In this paper, we present algorithms for subgroup detection and demonstrated them with a real-time case study of USS Cole bombing terrorist network. The algorithms are demonstrat...
Nasrullah Memon, Uffe Kock Wiil, Abdul Rasool Qure...
KES
2010
Springer
13 years 6 months ago
Extracting a Keyword Network of Flood Disaster Measures
For rapid and effective recovery from a flood disaster, an anti-disaster headquarters must not only assess the extent of damage, but also possess overall knowledge of the possibl...
Motoki Miura, Mitsuhiro Tokuda, Daiki Kuwahara