1982 search results - page 95 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
121
Voted
ALGORITHMICA
2006
15 years 2 months ago
2006
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
124
Voted
DMDW
2000
15 years 4 months ago
2000
View materialization is a central issue in logical design of data warehouses since it is one of the most powerful techniques to improve the response to the workload. Most approach...
128
Voted
ECCV
2002
Springer
16 years 4 months ago
2002
Springer
We propose Markov chain Monte Carlo sampling methods to address uncertainty estimation in disparity computation. We consider this problem at a postprocessing stage, i.e. once the d...
148
click to vote
CLUSTER
2003
IEEE
15 years 8 months ago
2003
IEEE
Dynamic programming is an important algorithm design technique in computational biology and scientific computing. Typical applications using this technique are very compute-intens...
117
Voted
TMM
2002
15 years 2 months ago
2002
Most image and video compression algorithms that have been proposed to improve picture quality relative to compression efficiency have either been designed based on objective crite...