Sciweavers

2570 search results - page 61 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
ECCV
2006
Springer
15 years 11 months ago
A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
Yi Deng, Xueyin Lin
SC
2009
ACM
15 years 2 months ago
A framework for core-level modeling and design of reconfigurable computing algorithms
Reconfigurable computing (RC) is rapidly becoming a vital technology for many applications, from high-performance computing to embedded systems. The inherent advantages of custom-...
Gongyu Wang, Greg Stitt, Herman Lam, Alan D. Georg...
GD
2004
Springer
15 years 3 months ago
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
PAMI
2008
139views more  PAMI 2008»
14 years 10 months ago
A Fast Algorithm for Learning a Ranking Function from Large-Scale Data Sets
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
Vikas C. Raykar, Ramani Duraiswami, Balaji Krishna...
ICCV
2009
IEEE
14 years 7 months ago
An algebraic model for fast corner detection
This paper revisits the classical problem of detecting interest points, popularly known as "corners," in 2D images by proposing a technique based on fitting algebraic sh...
Andrew Willis, Yunfeng Sui