Sciweavers

1541 search results - page 53 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
CIVR
2010
Springer
299views Image Analysis» more  CIVR 2010»
13 years 11 months ago
Co-reranking by mutual reinforcement for image search
Most existing reranking approaches to image search focus solely on mining "visual" cues within the initial search results. However, the visual information cannot always ...
Ting Yao, Tao Mei, Chong-Wah Ngo
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 3 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
14 years 2 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
ICIP
2006
IEEE
14 years 3 months ago
Discontinuity-Adaptive De-Interlacing Scheme Using Markov Random Field Model
— In this paper, a de-interlacing algorithm to find the optimal deinterlaced results given accuracy-limited motion information is proposed. The de-interlacing process is formula...
Min Li, Truong Q. Nguyen
IJCNN
2007
IEEE
14 years 3 months ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar