Sciweavers

2370 search results - page 138 / 474
» A Structured Set of Higher-Order Problems
Sort
View
131
Voted
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 4 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
166
Voted
ICDAR
2009
IEEE
15 years 1 months ago
A Unified Framework for Recognizing Handwritten Chemical Expressions
Chemical expressions have more variant structures in 2-D space than that in math equations. In this paper we propose a unified framework for recognizing handwritten chemical expre...
Ming Chang, Shi Han, Dongmei Zhang
ACCV
2006
Springer
15 years 9 months ago
Minimal Weighted Local Variance as Edge Detector for Active Contour Models
Performing segmentation of narrow, elongated structures with low contrast boundaries is a challenging problem. Boundaries of these structures are difficult to be located when noise...
Max W. K. Law, Albert C. S. Chung
134
Voted
DAWAK
2004
Springer
15 years 9 months ago
Mining Maximal Frequently Changing Subtree Patterns from XML Documents
Abstract. Due to the dynamic nature of online information, XML documents typically evolve over time. The change of the data values or structures of an XML document may exhibit some...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...
133
Voted
ICANN
2010
Springer
15 years 3 months ago
Computational Properties of Probabilistic Neural Networks
We discuss the problem of overfitting of probabilistic neural networks in the framework of statistical pattern recognition. The probabilistic approach to neural networks provides a...
Jiri Grim, Jan Hora