Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • BTU Cottbus  (3)
  • SB Guben
  • Feministisches Archiv
  • Kreisbibliothek des Landkreises Spree-Neiße
  • Datenverarbeitung  (3)
Type of Medium
Language
Region
Library
  • BTU Cottbus  (3)
  • SB Guben
  • Feministisches Archiv
  • Kreisbibliothek des Landkreises Spree-Neiße
  • FU Berlin  (1)
Years
Subjects(RVK)
Access
  • 1
    Online Resource
    Online Resource
    New York, NY : Springer New York
    UID:
    b3kat_BV045187187
    Format: 1 Online-Ressource (XII, 268 p)
    Edition: Second Edition
    ISBN: 9781475727678
    Series Statement: Signal Processing and Digital Filtering
    Content: This book is based on several courses taught during the years 1985-1989 at the City College of the City University of New York and at Fudan Univer­ sity, Shanghai, China, in the summer of 1986. It was originally our intention to present to a mixed audience of electrical engineers, mathematicians and computer scientists at the graduate level a collection of algorithms that would serve to represent the vast array of algorithms designed over the last twenty years for computing the finite Fourier transform (FFT) and finite convolution. However, it was soon apparent that the scope of the course had to be greatly expanded. For researchers interested in the design of new algorithms, a deeper understanding of the basic mathematical concepts underlying algorithm design was essential. At the same time, a large gap remained between the statement of an algorithm and the implementation of the algorithm. The main goal of this text is to describe tools that can serve both of these needs. In fact, it is our belief that certain mathematical ideas provide a natural language and culture for understanding, unifying and implementing a wide range of digital signal processing (DSP) algo­ rithms. This belief is reinforced by the complex and time-consuming effort required to write code for recently available parallel and vector machines. A significant part of this text is devoted to establishing rules and procedures that reduce and at times automate this task
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9781441931153
    Language: English
    Keywords: Digitale Signalverarbeitung ; Algorithmus ; Tensorprodukt ; Fourier-Transformation ; Datenverarbeitung ; Faltung ; Algorithmus ; Faltung ; Datenverarbeitung ; Diskrete Fourier-Transformation ; Algorithmus ; Aufgabensammlung
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    b3kat_BV045186656
    Format: 1 Online-Ressource (XV, 350 p. 1 illus)
    ISBN: 9781475738544
    Series Statement: Signal Processing and Digital Filtering
    Content: This book is based on several courses taught during the last five years at the City College of the City University of New York and at Fudan University, Shanghai, China in the Summer, 1986. It was originally our intention to present to a mixed audience of electrical engineers, mathematicians and computer scientists at the graduate level, a collection of algorithms which would serve to represent the vast array of algorithms designed over the last twenty years for com­ puting the finite Fourier transform (FFT) and finite convolution. However, it was soon apparent that the scope of the course had to be greatly expanded. For researchers interested in the design of new algorithms, a deeper understanding of the basic mathematical con­ cepts underlying algorithm design was essential. At the same time, a large gap remained between the statement of an algorithm and the implementation of the algorithm. The main goal of this text is to describe tools which can serve both of these needs. In fact, it is our belief that certain mathematical ideas provide a natural lan­ guage and culture for understanding, unifying and implementing a wide range of digital signal processing (DSP) algorithms. This belief is reenforced by the complex and time-consumming effort required to write code for recently available parallel and vector machines. A significant part of this text is devoted to establishing rules and precedures which reduce and at times automate this task. In Chapter 1, a survey is given of basic algebra
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9781475738568
    Language: English
    Keywords: Digitale Signalverarbeitung ; Algorithmus ; Tensorprodukt ; Fourier-Transformation ; Datenverarbeitung ; Faltung ; Algorithmus ; Faltung ; Datenverarbeitung ; Diskrete Fourier-Transformation ; Algorithmus ; Aufgabensammlung
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    New York, NY : Springer US
    UID:
    b3kat_BV046871499
    Format: 1 Online-Ressource (VIII, 490 p)
    Edition: 1st ed. 2000
    ISBN: 9781475748284
    Series Statement: International Series in Operations Research & Management Science 24
    Content: Great advances have been made in recent years in the field of computational probability. In particular, the state of the art - as it relates to queuing systems, stochastic Petri-nets and systems dealing with reliability - has benefited significantly from these advances. The objective of this book is to make these topics accessible to researchers, graduate students, and practitioners. Great care was taken to make the exposition as clear as possible. Every line in the book has been evaluated, and changes have been made whenever it was felt that the initial exposition was not clear enough for the intended readership. The work of major research scholars in this field comprises the individual chapters of Computational Probability. The first chapter describes, in nonmathematical terms, the challenges in computational probability. Chapter 2 describes the methodologies available for obtaining the transition matrices for Markov chains, with particular emphasis on stochastic Petri-nets.
    Content: Chapter 3 discusses how to find transient probabilities and transient rewards for these Markov chains. The next two chapters indicate how to find steady-state probabilities for Markov chains with a finite number of states. Both direct and iterative methods are described in Chapter 4. Details of these methods are given in Chapter 5. Chapters 6 and 7 deal with infinite-state Markov chains, which occur frequently in queueing, because there are times one does not want to set a bound for all queues. Chapter 8 deals with transforms, in particular Laplace transforms. The work of Ward Whitt and his collaborators, who have recently developed a number of numerical methods for Laplace transform inversions, is emphasized in this chapter. Finally, if one wants to optimize a system, one way to do the optimization is through Markov decision making, described in Chapter 9.
    Content: Markov modeling has found applications in many areas, three of which are described in detail: Chapter 10 analyzes discrete-time queues, Chapter 11 describes networks of queues, and Chapter 12 deals with reliability theory
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9781441951007
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9780792386179
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9781475748291
    Language: English
    Subjects: Computer Science , Mathematics
    RVK:
    RVK:
    Keywords: Wahrscheinlichkeitsrechnung ; Datenverarbeitung
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean the new york tides?
Did you mean the new york tiles?
Did you mean the new york temes?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages