Results 1  10
of
16
Algorithms for chordal analysis
 ISSN 01489267. doi: http://dx.doi.org/10.1162/ 014892602760137167. (Cited on
"... This paper describes a system for chordal analysis of tonal music. We establish that, in the worst case, the segmenting the music and labeling the harmonies takes on the order of 2^n steps, where n is number of notes in a piece of music. We show that, when segments of the music can be analyzed local ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
(Show Context)
This paper describes a system for chordal analysis of tonal music. We establish that, in the worst case, the segmenting the music and labeling the harmonies takes on the order of 2^n steps, where n is number of notes in a piece of music. We show that, when segments of the music can be analyzed locally, the problem becomes O(n^2). We then show that the results of the O(n^2) search can be closely approximated through the use of a heuristic that allows O(n) time search. The results of the segmenting and chord labeling algorithms are then empirically measured against analyses derived from a basic music theory text and the statistical results are reported.
TEX by Topic: A TEXnician’s Reference
, 1992
"... This is – apart from minor changes – the full text of the book TEX by Topic, copyright 19912004 Victor Eijkhout. This book was printed in 1991 by AddisonWesley UK, ISBN 0201568829, reprinted in 1993, pdf version first made available 2001. This electronic book may be copied; the pdf file of this ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
This is – apart from minor changes – the full text of the book TEX by Topic, copyright 19912004 Victor Eijkhout. This book was printed in 1991 by AddisonWesley UK, ISBN 0201568829, reprinted in 1993, pdf version first made available 2001. This electronic book may be copied; the pdf file of this book may be printed and given away, and it may be included in archives and on web sites; the book may be distributed in unaltered form both on paper and electronic media. You are not allowed to make any changes to the file or to reverse engineer its source; you are not allowed to charge for its distribution – whether in physical or electronic form – beyond reasonable material costs. If you have comments or want to express your appreciation that you are getting this book that formerly sold for ≈$30 for free, please visit
Optimization and Relaxation in Logic Languages
 Department of Computer Science, SUNYBuffalo
, 1997
"... Acknowledgements I wish to thank: 1. my advisor, Bharat Jayaraman, to whom this dissertation owes its existence in an uncountable number of ways, 2. Surya Mantha of Xerox Corporation, for input at various crucial stages, 3. Xerox Corporation, for generously providing funds that supported most of thi ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Acknowledgements I wish to thank: 1. my advisor, Bharat Jayaraman, to whom this dissertation owes its existence in an uncountable number of ways, 2. Surya Mantha of Xerox Corporation, for input at various crucial stages, 3. Xerox Corporation, for generously providing funds that supported most of this work, 4. the rest of my committee, namely, Prof. Alan L. Selman and Prof. Kenneth W. Regan, for their interest in my welfare, 5. the secretaries in the department of computer science, for, among other things, shielding me from administrivial vagaries of the University, 6. my friends, for believing in, supporting, and encouraging me through thick andthin. I shall refrain from enumerating names here for fear of making the list longer than the rest of my dissertation.
Dynamic Programming: a different perspective
 Algorithmic Languages and Calculi
, 1997
"... Dynamic programming has long been used as an algorithm design technique, with various mathematical theories proposed to model it. Here we take a different perspective, using a relational calculus to model the problems and solutions using dynamic programming. This approach serves to shed new light on ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Dynamic programming has long been used as an algorithm design technique, with various mathematical theories proposed to model it. Here we take a different perspective, using a relational calculus to model the problems and solutions using dynamic programming. This approach serves to shed new light on the different styles of dynamic programming, representing them by different search strategies of the treelike space of partial solutions. 1 INTRODUCTION AND HISTORY Dynamic programming is an algorithm design technique for solving many different types of optimization problem, applicable to such diverse fields as operations research (Ecker and Kupferschmid, 1988) and neutron transport theory (Bellman, Kagiwada and Kalaba, 1967). The mathematical theory of the subject dates back to 1957, when Richard Bellman (Bellman, 1957) first popularized the idea, producing a mathematical theory to model multistage decision processes and to solve related optimization problems. He was also the first to i...
Notes on Compound Word Hyphenation in TEX
 TUGBOAT
, 1995
"... In (Sojka and Ševeček 1994) we presented a case study of problems related to achieving quality hyphenation in TEX — especially pattern generation for flexive languages like Czech. It was shown that pretty much issues can be handled within the frame of good old TEX, but some of them definitely not, ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In (Sojka and Ševeček 1994) we presented a case study of problems related to achieving quality hyphenation in TEX — especially pattern generation for flexive languages like Czech. It was shown that pretty much issues can be handled within the frame of good old TEX, but some of them definitely not, because TEX wasn’t primarily designed from the beginning as a universal tool for the typesetting of all kinds of publications in all languages, but typesetting of The Art of Computer Programming (Knuth 1968–) in American English was the initial motivation. In this paper we continue elaborating these issues, with the emphasis on the hyphenation problems in the presence of long compound words in Germanic (and Slavic) languages.
Bridging the Algorithm Gap: A Lineartime Functional Program for Paragraph Formatting
 Science of Computer Programming
, 1997
"... In the constructive programming community it is commonplace to see formal developments of textbook algorithms. In the algorithm design community, on the other hand, it may be well known that the textbook solution to a problem is not the most efficient possible. However, in presenting the more eff ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
In the constructive programming community it is commonplace to see formal developments of textbook algorithms. In the algorithm design community, on the other hand, it may be well known that the textbook solution to a problem is not the most efficient possible. However, in presenting the more efficient solution, the algorithm designer will usually omit some of the implementation details, thus creating an algorithm gap between the abstract algorithm and its concrete implementation. This is in contrast to the formal development, which usually presents the complete concrete implementation of the less efficient solution. We claim that the algorithm designer is forced to omit some of the details by the relative expressive poverty of the Pascallike languages typically used to present the solution; the greater expressiveness provided by a functional language allows the whole story to be told in a reasonable amount of space. We therefore hope to bridge the algorithm gap between ab...
Generating TEX from mathematical content with respect to notational settings
"... elena (at) orcca dot on dot ca ..."
(Show Context)