Sciweavers

849 search results - page 37 / 170
» Study of Challenges and Techniques in Large Scale Matching
Sort
View
EMNLP
2008
14 years 11 months ago
Scalable Language Processing Algorithms for the Masses: A Case Study in Computing Word Co-occurrence Matrices with MapReduce
This paper explores the challenge of scaling up language processing algorithms to increasingly large datasets. While cluster computing has been available in commercial environment...
Jimmy J. Lin
69
Voted
ICPR
2008
IEEE
15 years 4 months ago
Epipolar geometry and log-polar transform in wide baseline stereo matching
This paper presents an interesting observation that epipolar geometry and log–polar transform can be naturally combined by setting the center of the log–polar transform into t...
Kimmo Palander, Sami S. Brandt
82
Voted
JMLR
2006
125views more  JMLR 2006»
14 years 10 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
87
Voted
CLUSTER
2008
IEEE
15 years 4 months ago
A trace-driven emulation framework to predict scalability of large clusters in presence of OS Jitter
—Various studies have pointed out the debilitating effects of OS Jitter on the performance of parallel applications on large clusters such as the ASCI Purple and the Mare Nostrum...
Pradipta De, Ravi Kothari, Vijay Mann
81
Voted
MVA
2002
119views Computer Vision» more  MVA 2002»
14 years 10 months ago
A Cooperative Method of SFM and Stereo for Motion and Depth Extraction
Stereo is a useful technique for obtaining depth information from images. However, it is required that the baseline length between two cameras should be large to increase depth pr...
Jae-Hean Kim, Myung Jin Chung