1369 search results - page 61 / 274 » Lattice computations for random numbers |
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
The Random Sample Consensus (RANSAC) algorithm is a popular tool for robust estimation problems in computer vision, primarily due to its ability to tolerate a tremendous fraction o...
RECOMB
2006
Springer
14 years 9 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
ISIPTA
2005
IEEE
14 years 2 months ago
2005
IEEE
Uncertainty is a key issue in decision analysis and other kinds of applications. Researchers have developed a number of approaches to address computations on uncertain quantities....
STOC
2000
ACM
14 years 1 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
WSC
2008
13 years 11 months ago
2008
We are interested in computing tail probabilities for the maxima of Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number...