Sciweavers

2745 search results - page 283 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
MFCS
2005
Springer
15 years 10 months ago
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
PPSN
1998
Springer
15 years 9 months ago
Inver-over Operator for the TSP
Abstract. In this paper we investigate the usefulness of a new operator, inver-over, for an evolutionary algorithm for the TSP. Inver-over is based on simple inversion, however, kn...
Guo Tao, Zbigniew Michalewicz
SAC
2008
ACM
15 years 4 months ago
Efficient concept clustering for ontology learning using an event life cycle on the web
Ontology learning integrates many complementary techniques, including machine learning, natural language processing, and data mining. Specifically, clustering techniques facilitat...
Sangsoo Sung, Seokkyung Chung, Dennis McLeod
PC
1998
101views Management» more  PC 1998»
15 years 4 months ago
Performing Out-of Core FFTs on Parallel Disk Systems
The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most one-dimensional FFT problems canbe entirely solvedentirely ...
Thomas H. Cormen, David M. Nicol
131
Voted
SIAMAM
2002
129views more  SIAMAM 2002»
15 years 4 months ago
Periodic Wavelet Transforms and Periodicity Detection
The theory of periodic wavelet transforms presented here was originally developed to deal with the problem of epileptic seizure prediction. A central theorem in the theory is the c...
Götz E. Pfander, John J. Benedetto