Sciweavers

13214 search results - page 405 / 2643
» Pseudorandomness for network algorithms
Sort
View
MMNS
2003
119views Multimedia» more  MMNS 2003»
15 years 8 months ago
A New Available Bandwidth Measurement Technique for Service Overlay Networks
Abstract. We introduce a new measurement algorithm for the available bandwidth in a network path between two endhosts. This algorithm is an adaptation from existing active measurem...
Cao Le Thanh Man, Go Hasegawa, Masayuki Murata
ICC
2009
IEEE
150views Communications» more  ICC 2009»
15 years 4 months ago
Efficient Resource Discovery in Mobile Ad Hoc Networks
Abstract--The highly dynamic nature of infrastructureless adhoc networks poses new challenges during resource discovery. In this paper, we propose a novel algorithm for resource di...
Ravi Thanawala, Jie Wu, Avinash Srinivasan
SGAI
2007
Springer
16 years 1 months ago
Evolving a Dynamic Predictive Coding Mechanism for Novelty Detection
Novelty detection is a machine learning technique which identifies new or unknown information in large data sets. We present our current work on the construction of a new novelty...
Simon J. Haggett, Dominique F. Chu, Ian W. Marshal...
ASUNAM
2010
IEEE
15 years 8 months ago
Detecting Highly Overlapping Communities with Model-Based Overlapping Seed Expansion
Abstract--As research into community finding in social networks progresses, there is a need for algorithms capable of detecting overlapping community structure. Many algorithms hav...
Aaron McDaid, Neil Hurley
IPL
2011
91views more  IPL 2011»
14 years 10 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...