Sciweavers

3247 search results - page 173 / 650
» Randomized smoothing networks
Sort
View
ICPR
2010
IEEE
15 years 10 months ago
Using Sequential Context for Image Analysis
—This paper proposes the sequential context inference (SCI) algorithm for Markov random field (MRF) image analysis. This algorithm is designed primarily for fast inference on an...
Antonio Paiva, Elizabeth Jurrus, Tolga Tasdizen
IPTPS
2003
Springer
15 years 9 months ago
A Simple Fault Tolerant Distributed Hash Table
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
Moni Naor, Udi Wieder
PCI
2005
Springer
15 years 10 months ago
Source-Based Minimum Cost Multicasting: Intermediate-Node Selection with Potentially Low Cost
Abstract. In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an impr...
Gunu Jho, Moonseong Kim, Hyunseung Choo
COMCOM
2006
77views more  COMCOM 2006»
15 years 4 months ago
SIP as a unified signalling solution in a beyond 3G system
The adoption of packet-switched technologies in mobile communication systems has enabled the provision of IPbased services to mobile users. Yet, these systems, such as the UMTS net...
Vaggelis Nikas, Georgios V. Lioudakis, Nikolaos L....
GLOBECOM
2010
IEEE
15 years 1 months ago
Information Epidemics in Complex Networks with Opportunistic Links and Dynamic Topology
Abstract--Wireless networks, especially mobile ad hoc networks (MANET) and cognitive radio networks (CRN), are facing two new challenges beyond traditional random network model: op...
Pin-Yu Chen, Kwang-Cheng Chen