4302 search results - page 229 / 861 » Index Pairs Algorithms |
ICPR
2000
IEEE
16 years 1 months ago
2000
IEEE
Most page segmentation algorithms have userspecifiable free parameters. However, algorithm designers typically do not provide a quantitative/rigorous method for choosing values fo...
104
Voted
ALT
2004
Springer
15 years 9 months ago
2004
Springer
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
124
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
102
Voted
CAIP
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
113
Voted
ADC
2008
Springer
15 years 2 months ago
2008
Springer
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...