Sciweavers

54 search results - page 5 / 11
» Constructing an optimal server set in structured peer-to-pee...
Sort
View
FSTTCS
2004
Springer
14 years 27 days ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
JOC
2007
94views more  JOC 2007»
13 years 7 months ago
On Unconditionally Secure Distributed Oblivious Transfer
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...
Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Dou...
ANTSW
2004
Springer
14 years 28 days ago
An Ant Approach to Membership Overlay Design
Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership a...
Vittorio Maniezzo, Marco A. Boschetti, Márk...
CVPR
2004
IEEE
14 years 9 months ago
Learning a Restricted Bayesian Network for Object Detection
Many classes of images have the characteristics of sparse structuring of statistical dependency and the presence of conditional independencies among various groups of variables. S...
Henry Schneiderman
DAS
2006
Springer
13 years 9 months ago
Extraction and Analysis of Document Examiner Features from Vector Skeletons of Grapheme 'th'
Abstract. This paper presents a study of 25 structural features extracted from samples of grapheme `th' that correspond to features commonly used by forensic document examiner...
Vladimir Pervouchine, Graham Leedham