Sciweavers

245 search results - page 30 / 49
» The Iterated Weakest Link
Sort
View
OPODIS
2010
14 years 9 months ago
Biased Selection for Building Small-World Networks
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
Andrés Sevilla, Alberto Mozo, M. Araceli Lo...
CORR
2010
Springer
261views Education» more  CORR 2010»
14 years 9 months ago
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
Mathieu Cunche, Valentin Savin, Vincent Roca
AMAI
2007
Springer
14 years 12 months ago
Relational concept discovery in structured datasets
Relational datasets, i.e., datasets in which individuals are described both by their own features and by their relations to other individuals, arise from various sources such as d...
Marianne Huchard, Mohamed Rouane Hacene, Cyril Rou...
WWW
2005
ACM
16 years 13 days ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
CHI
2007
ACM
16 years 5 days ago
Authoring sensor-based interactions by demonstration with direct manipulation and pattern recognition
Sensors are becoming increasingly important in interaction design. Authoring a sensor-based interaction comprises three steps: choosing and connecting the appropriate hardware, cr...
Björn Hartmann, Leith Abdulla, Manas Mittal, ...