Sciweavers

17760 search results - page 260 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
IPPS
2005
IEEE
16 years 8 days ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
151
Voted
KBSE
2005
IEEE
16 years 8 days ago
Constructing interaction test suites with greedy algorithms
Combinatorial approaches to testing are used in several fields, and have recently gained momentum in the field of software testing through software interaction testing. One-test...
Renée C. Bryce, Charles J. Colbourn
CIS
2005
Springer
16 years 4 days ago
Two Adaptive Matching Learning Algorithms for Independent Component Analysis
Independent component analysis (ICA) has been applied in many fields of signal processing and many ICA learning algorithms have been proposed from different perspectives. However...
Jinwen Ma, Fei Ge, Dengpan Gao
ANTS
1994
Springer
105views Algorithms» more  ANTS 1994»
15 years 10 months ago
A fast variant of the Gaussian reduction algorithm
We propose a fast variant of the Gaussian algorithm for the reduction of two{ dimensional lattices for the l1; l2; and l1;norm. The algorithm runs in at most O(n M(B) logB) bit op...
Michael Kaib
ECIR
2007
Springer
15 years 8 months ago
A Study of Global Inference Algorithms in Multi-document Summarization
Abstract. In this work we study the theoretical and empirical properties of various global inference algorithms for multi-document summarization. We start by defining a general fr...
Ryan T. McDonald