Sciweavers

1434 search results - page 114 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
ICPP
2009
IEEE
14 years 9 months ago
Mediacoop: Hierarchical Lookup for P2P-VoD Services
The random seeking in P2P-VoD system requires efficient lookup for "good" suppliers. The main challenge is that good suppliers should meet two requirements: "conten...
Tieying Zhang, Jianming Lv, Xueqi Cheng
PR
2011
14 years 2 months ago
Hierarchical annotation of medical images
In this paper, we describe an approach for the automatic medical annotation task of the 2008 CLEF cross-language image retrieval campaign (ImageCLEF). The data comprise 12076 full...
Ivica Dimitrovski, Dragi Kocev, Suzana Loskovska, ...
SPAA
2009
ACM
16 years 2 days ago
A DoS-resilient information system for dynamic data management
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
Matthias Baumgart, Christian Scheideler, Stefan Sc...
177
Voted
CLUSTER
2011
IEEE
13 years 11 months ago
A mobility-based cluster formation algorithm for wireless mobile ad-hoc networks
  In the last decade, numerous efforts have been devoted to design efficient algorithms for clustering the  wireless mobile ad‐hoc networks (MANET) consider...
Javad Akbari Torkestani, Mohammad Reza Meybodi
IPPS
2005
IEEE
15 years 5 months ago
Optimal Oblivious Path Selection on the Mesh
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
Costas Busch, Malik Magdon-Ismail, Jing Xi