Sciweavers

35 search results - page 7 / 7
» Fast discovery of connection subgraphs
Sort
View
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 5 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
MOBICOM
2004
ACM
13 years 11 months ago
Reducing MAC layer handoff latency in IEEE 802.11 wireless LANs
With the growth of IEEE 802.11-based wireless LANs, VoIP and similar applications are now commonly used over wireless networks. Mobile station performs a handoff whenever it move...
Sangho Shin, Andrea G. Forte, Anshuman Singh Rawat...
SEMWEB
2009
Springer
13 years 10 months ago
A Weighted Approach to Partial Matching for Mobile Reasoning
Due to significant improvements in the capabilities of small devices such as PDAs and smart phones, these devices can not only consume but also provide Web Services. The dynamic n...
Luke Albert Steller, Shonali Krishnaswamy, Mohamed...
AI
2002
Springer
13 years 5 months ago
Emergence of social conventions in complex networks
The emergence of social conventions in multi-agent systems has been analyzed mainly in settings where every agent may interact either with every other agent or with nearest neighb...
Jordi Delgado
JNW
2006
68views more  JNW 2006»
13 years 5 months ago
Quick Local Repair Scheme using Adaptive Promiscuous Mode in Mobile Ad Hoc Networks
In mobile ad hoc networks (MANETs), there is frequently disconnected a route consisting of multi-hop from a source to a destination because of the dynamic nature such as the topolo...
Joo Sang Youn, Jihoon Lee, Doo-Hyun Sung, Chul-Hee...