Sciweavers

3630 search results - page 225 / 726
» Fast Marching Methods
Sort
View
TVCG
2010
141views more  TVCG 2010»
15 years 4 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar
EMNLP
2010
15 years 4 months ago
A Fast Fertility Hidden Markov Model for Word Alignment Using MCMC
A word in one language can be translated to zero, one, or several words in other languages. Using word fertility features has been shown to be useful in building word alignment mo...
Shaojun Zhao, Daniel Gildea
ICIP
2010
IEEE
15 years 4 months ago
Fast and robust active contours for image segmentation
Active models are widely used in applications like image segmentation and tracking. Region-based active models are known for robustness to weak edges and high computational comple...
Wei Yu, Franz Franchetti, Yao-Jen Chang, Tsuhan Ch...
NAACL
2010
15 years 4 months ago
Cheap, Fast and Good Enough: Automatic Speech Recognition with Non-Expert Transcription
Deploying an automatic speech recognition system with reasonable performance requires expensive and time-consuming in-domain transcription. Previous work demonstrated that non-pro...
Scott Novotney, Chris Callison-Burch
CORR
2011
Springer
157views Education» more  CORR 2011»
15 years 1 months ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek