Sciweavers

374 search results - page 73 / 75
» Stochastic Minority on Graphs
Sort
View
MOBIHOC
2002
ACM
14 years 7 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
CVPR
2009
IEEE
14 years 5 months ago
Markov Chain Monte Carlo Combined with Deterministic Methods for Markov Random Field Optimization
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
Wonsik Kim (Seoul National University), Kyoung Mu ...
PODC
2005
ACM
14 years 28 days ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
P2P
2003
IEEE
110views Communications» more  P2P 2003»
14 years 19 days ago
The Effectiveness of Realistic Replication Strategies on Quality of Availability for Peer-to-Peer Systems
In this paper, we take an availability-centric view on quality of service (QoS) and propose a model and mechanisms for studying the effectiveness of realistic replication schemes ...
Giwon On, Jens Schmitt, Ralf Steinmetz
BMCBI
2007
160views more  BMCBI 2007»
13 years 7 months ago
Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
Wasinee Rungsarityotin, Roland Krause, Arno Sch&ou...