Sciweavers

903 search results - page 50 / 181
» On the reduction of a random basis
Sort
View

Book
5396views
17 years 28 days ago
Markov Random Field Modeling in Computer Vision
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
Stan Z. Li
IPPS
1998
IEEE
15 years 6 months ago
A Molecular Quasi-Random Model of Computations Applied to Evaluate Collective Intelligence
The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon - the Collective Intelli...
Tadeusz Szuba
JSAC
2008
98views more  JSAC 2008»
15 years 1 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
PODS
2012
ACM
276views Database» more  PODS 2012»
13 years 4 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
ICDE
2002
IEEE
116views Database» more  ICDE 2002»
16 years 3 months ago
SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks
Scalable storage architectures allow for the addition of disks to increase storage capacity and/or bandwidth. In its general form, disk scaling also refers to disk removals when e...
Ashish Goel, Cyrus Shahabi, Shu-Yuen Didi Yao, Rog...