Sciweavers

5114 search results - page 141 / 1023
» Complex networks
Sort
View
MOBIHOC
2010
ACM
13 years 7 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
PDSE
2000
96views more  PDSE 2000»
13 years 10 months ago
Applying Distributed Object Technology to Network Planning
The aim of this paper is to describe a generic interface through which a planning tool or design aid can be connected to a telecommunications network. In today's complex and ...
Tertius D. Wessels, Judy M. Bishop
IRCDL
2010
13 years 7 months ago
Toward Conversation Retrieval
Social Network Sites can be seen as very large information repositories containing millions of text messages usually organized into complex networks involving users interacting wit...
Matteo Magnani, Danilo Montesi
DEBS
2008
ACM
13 years 10 months ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 9 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen