Sciweavers

1578 search results - page 65 / 316
» Algorithmic randomness of continuous functions
Sort
View
CSDA
2007
100views more  CSDA 2007»
14 years 9 months ago
Convergence of random k-nearest-neighbour imputation
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
Fredrik A. Dahl
PDP
2006
IEEE
15 years 3 months ago
A Distributed Query Structure to Explore Random Mappings in Parallel
We explore the possibilities to organize a query data structure in the main memories or hard disks of a cluster computer. The query data structure serves to improve the performanc...
Jan Heichler, Jorg Keller
STOC
2000
ACM
112views Algorithms» more  STOC 2000»
15 years 2 months ago
A random graph model for massive graphs
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 ...
William Aiello, Fan R. K. Chung, Linyuan Lu
IVC
2007
121views more  IVC 2007»
14 years 9 months ago
Automatic selection of MRF control parameters by reactive tabu search
This paper presents an optimisation technique to automatically select a set of control parameters for a Markov Random Field. The method is based on the Reactive Tabu Search strate...
Umberto Castellani, Andrea Fusiello, Riccardo Gher...
POPL
2004
ACM
15 years 10 months ago
Global value numbering using random interpretation
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
Sumit Gulwani, George C. Necula