Sciweavers

3356 search results - page 338 / 672
» Determining Consensus Numbers
Sort
View
IVC
2000
179views more  IVC 2000»
15 years 18 days ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
126
Voted
PRL
2000
182views more  PRL 2000»
15 years 17 days ago
Bayesian MLP neural networks for image analysis
We demonstrate the advantages of using Bayesian multi layer perceptron (MLP) neural networks for image analysis. The Bayesian approach provides consistent way to do inference by c...
Aki Vehtari, Jouko Lampinen
111
Voted
IJCM
2002
92views more  IJCM 2002»
15 years 17 days ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
IJCV
2002
129views more  IJCV 2002»
15 years 14 days ago
A Hierarchical Symmetric Stereo Algorithm Using Dynamic Programming
In this paper, a new hierarchical stereo algorithm is presented. The algorithm matches individual pixels in corresponding scanlines by minimizing a cost function. Several cost fun...
G. Van Meerbergen, Maarten Vergauwen, Marc Pollefe...
CPC
1998
123views more  CPC 1998»
15 years 14 days ago
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...
Michael Molloy, Bruce A. Reed