Sciweavers

359 search results - page 24 / 72
» Using graph analysis to study networks of adaptive agent
Sort
View
TMC
2008
210views more  TMC 2008»
13 years 7 months ago
Adaptive Cluster-Based Data Collection in Sensor Networks with Direct Sink Access
Recently wireless sensor networks featuring direct sink access have been studied as an efficient architecture to gather and process data for numerous applications. In this paper, w...
Mahdi Lotfinezhad, Ben Liang, Elvino S. Sousa
MOBIHOC
2007
ACM
14 years 7 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 14 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
14 years 8 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
SIGMETRICS
2008
ACM
119views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Network externalities and the deployment of security features and protocols in the internet
Getting new security features and protocols to be widely adopted and deployed in the Internet has been a continuing challenge. There are several reasons for this, in particular ec...
Marc Lelarge, Jean Bolot