Results 1 to 10 of about 30,320 (133)

Fast divide-and-conquer algorithms for preemptive scheduling problems with controllable processing times – A polymatroid optimization approach [PDF]

, 2008
We consider a variety of preemptive scheduling problems with controllable processing times on a single machine and on identical/uniform parallel machines, where the objective is to minimize the total compression cost.
A. Federgruen, A. Janiak, D.S. Hochbaum, E. Nowicki, G. Gallo, J.Y. Chung, J.Y.-T. Leung, J.Y.-T. Leung, N.V. Shakhlevich, N.V. Shakhlevich, R. McNaughton, R.K. Ahuja, S. Fujishige, S. Sahni, S. Sahni, S.T. McCormick, T.F. Gonzales, W. Horn, W.-K. Shih, W.-K. Shih, W.-K. Shih   +20 more
core   +1 more source

Computationally efficient induction of classification rules with the PMCRI and J-PMCRI frameworks [PDF]

, 2012
In order to gain knowledge from large databases, scalable data mining technologies are needed. Data are captured on a large scale and thus databases are increasing at a fast pace.
Berrar, Bramer, Bramer, Bramer, Bramer, Bramer, Cendrowska, Cohen, Corkill, Frederic Stahl, Hennessy, Hunt, Hwang, Jiang, Max Bramer, Michalski, Mutlu, Nolle, Pham, Provost, Quinlan, Quinlan, Smyth, Stahl, Stahl, Stahl, Stahl, Szalay, Witten, Xavier   +29 more
core   +1 more source

Divide-and-conquer sequential matrix diagonalisation for parahermitian matrices [PDF]

, 2017
A number of algorithms capable of iteratively calculating a polynomial matrix eigenvalue decomposition (PEVD) have been introduced. The PEVD is a generalisation of the ordinary EVD and will diagonalise a parahermitian matrix via paraunitary operations ...
Corr, Jamie, Coutts, Fraser K., Proudler, Ian K., Thompson, Keith, Weiss, Stephan   +4 more
core   +1 more source

Divide-and-conquer algorithms for multiprocessors [PDF]

, 1991
During the past decade there has been a tremendous surge in understanding the nature of parallel computation. A number of parallel computers are commercially available.
Mukkavilli, Lakshmankumar
core   +3 more sources

Applications of the complexity space to the General Probabilistic Divide and Conquer Algorithms [PDF]

, 2008
Schellekens [M. Schellekens, The Smyth completion: A common foundation for denotational semantics and complexity analysis, in: Proc. MFPS 11, in: Electron. Notes Theor. Comput. Sci., vol. 1, 1995, pp. 535–556], and Romaguera and Schellekens [S. Romaguera,
García-Raffi, L.M., Romaguera, S., Schellekens, M.P.   +2 more
core   +1 more source

Supporting divide-and-conquer algorithms for image processing [PDF]

, 1987
Divide-and-conquer is an important algorithm strategy, but it is not widely used in image processing. For higher-level, symbolic operations it should often be the strategy of choice for parallel computers.
Quentin F. Stout, Quentin F. Stout
core   +2 more sources

Singularity analysis, Hadamard products, and tree recurrences [PDF]

, 2003
We present a toolbox for extracting asymptotic information on the coefficients of combinatorial generating functions. This toolbox notably includes a treatment of the effect of Hadamard products on singularities in the context of the complex Tauberian ...
Abramowitz, Berndt, Bieberbach, Bousquet-Mélou, Chern, Chern, Chyzak, Corless, Cormen, Cover, Dean, Dienes, Doyle, Fill, Finch, Flajolet, Flajolet, Flajolet, Flajolet, Flajolet, Flajolet, Flajolet, Flajolet, Glasser, Goulden, Greene, Guttmann, Henrici, Henrici, Hofri, Hoshi, Hwang, James Allen Fill, Knuth, Knuth, Knuth, Knuth, Lawler, Louchard, Louchard, Mahmoud, Mahmoud, Meir, Neininger, Nevin Kapur, Odlyzko, Olver, Philippe Flajolet, Pittel, Roura, Rösler, Sedgewick, Sedgewick, Stanley, Szpankowski, Takács, Vitter, Whittaker   +57 more
core   +3 more sources

Fast Fourier Transforms for the Rook Monoid

, 2007
We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it.
Malandro, Martin, Rockmore, Daniel N.
core   +1 more source

Performance of a Class of Highly-Parallel Divide-and-Conquer Algorithms [PDF]

, 1995
A wide range of important problems have efficient methods of solution based on the divide-and-conquer strategy. However, the traditional approach to parallel divide-and-conquer does not scale well due to the sequential component of the algorithms.
Thornley, John
core   +1 more source

Analysing the performance of divide-and-conquer sequential matrix diagonalisation for large broadband sensor arrays [PDF]

, 2017
A number of algorithms capable of iteratively calculating a polynomial matrix eigenvalue decomposition (PEVD) have been introduced. The PEVD is an extension of the ordinary EVD to polynomial matrices and will diagonalise a parahermitian matrix using ...
Coutts, Fraser K., Proudler, Ian K., Thompson, Keith, Weiss, Stephan   +3 more
core   +1 more source