Sciweavers

1528 search results - page 151 / 306
» On Signatures for Communication Graphs
Sort
View
CNSR
2007
IEEE
181views Communications» more  CNSR 2007»
15 years 10 months ago
The Application of Users' Collective Experience for Crafting Suitable Search Engine Query Recommendations
Search engines have turned into one of the most important services of the Web that are frequently visited by any user. They assist their users in finding appropriate information. ...
Faezeh Ensan, Ebrahim Bagheri, Mohsen Kahani
COCOON
2008
Springer
15 years 8 months ago
Spreading Messages
Abstract. We model a network in which messages spread by a simple directed graph G = (V, E) [1] and a function : V N mapping each v V to a positive integer less than or equal to...
Ching-Lueh Chang, Yuh-Dauh Lyuu
IMCSIT
2010
15 years 4 months ago
Efficient Coloring of Wireless Ad Hoc Networks With Diminished Transmitter Power
In our work we present a new approach to the problem of channel assignment in Wireless Ad Hoc Network. We introduce a new algorithm which works in distributed model of computations...
Krzysztof Krzywdzinski
WSDM
2012
ACM
245views Data Mining» more  WSDM 2012»
14 years 1 months ago
The early bird gets the buzz: detecting anomalies and emerging trends in information networks
In this work we propose a novel approach to anomaly detection in streaming communication data. We first build a stochastic model for the system based on temporal communication pa...
Brian Thompson
MOBIHOC
2002
ACM
16 years 6 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman