Sciweavers

1403 search results - page 209 / 281
» Set cover algorithms for very large datasets
Sort
View
ICPR
2000
IEEE
15 years 2 months ago
Hidden Markov Random Field Based Approach for Off-Line Handwritten Chinese Character Recognition
This paper presents a Hidden Markov Mesh Random Field (HMMRF) based approach for off-line handwritten Chinese characters recognition using statistical observation sequences embedd...
Qing Wang, Rongchun Zhao, Zheru Chi, David Dagan F...
VISUALIZATION
2000
IEEE
15 years 2 months ago
Topology preserving and controlled topology simplifying multiresolution isosurface extraction
Multiresolution methods are becoming increasingly important tools for the interactive visualization of very large data sets. Multiresolution isosurface visualization allows the us...
Thomas Gerstner, Renato Pajarola
MINAR
1998
Springer
113views Multimedia» more  MINAR 1998»
15 years 2 months ago
Envelope Parameter Calculation of Similarity Indexing Structure
SimilarityIndexing is very importantfor content-basedretrieval on large multimedia databases, and the "tightness"of data set envelope is a factor that influences the perf...
Xuesheng Bai, Guangyou Xu, Yuanchun Shi
FLAIRS
2001
14 years 11 months ago
A Practical Markov Chain Monte Carlo Approach to Decision Problems
Decisionand optimizationproblemsinvolvinggraphsarise in manyareas of artificial intelligence, including probabilistic networks, robot navigation, and network design. Manysuch prob...
Timothy Huang, Yuriy Nevmyvaka
NIPS
2004
14 years 11 months ago
Parallel Support Vector Machines: The Cascade SVM
We describe an algorithm for support vector machines (SVM) that can be parallelized efficiently and scales to very large problems with hundreds of thousands of training vectors. I...
Hans Peter Graf, Eric Cosatto, Léon Bottou,...