Sciweavers

4850 search results - page 595 / 970
» Approximate Data Structures with Applications
Sort
View
SADM
2010
194views more  SADM 2010»
15 years 5 months ago
Seriation and matrix reordering methods: An historical overview
: Seriation is an exploratory combinatorial data analysis technique to reorder objects into a sequence along a one-dimensional continuum so that it best reveals regularity and patt...
Innar Liiv
ICST
2009
IEEE
15 years 4 months ago
Euclide: A Constraint-Based Testing Framework for Critical C Programs
Euclide is a new Constraint-Based Testing tool for verifying safety-critical C programs. By using a mixture of symbolic and numerical analyses (namely static single assignment for...
Arnaud Gotlieb
ICASSP
2011
IEEE
14 years 10 months ago
Learning non-parametric models of pronunciation
As more data becomes available for a given speech recognition task, the natural way to improve recognition accuracy is to train larger models. But, while this strategy yields mode...
Brian Hutchinson, Jasha Droppo
CVPR
2010
IEEE
16 years 3 months ago
Disambiguating Visual Relations Using Loop Constraints
Repetitive and ambiguous visual structures in general pose a severe problem in many computer vision applications. Identification of incorrect geometric relations between images s...
Christopher Zach, Manfred Klopschitz, Marc Pollefe...
ICMCS
2007
IEEE
159views Multimedia» more  ICMCS 2007»
16 years 1 months ago
Accelerating Mutual-Information-Based Linear Registration on the Cell Broadband Engine Processor
Emerging multi-core processors are able to accelerate medical imaging applications by exploiting the parallelism available in their algorithms. We have implemented a mutual-inform...
Moriyoshi Ohara, Hangu Yeo, Frank Savino, Giridhar...