Secondly, we show how to count all star-shaped polygons whose vertices are a subset of ( S ) in ( O(n^5log n) ) time and ( O(n) ) space. The algorithm can also be used for random uniform generation. We also present lower and upper bounds on the number of star-shaped polygons.}, author = {Sohler, Christian}, booktitle = {Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG'99)}, pages = {174--177}, title = {{Generating Random Star-Shaped Polygons}}, year = {1999}, } @inproceedings{18747, abstract = {We present a new ( O(n) ) algorithm to compute good orders for the point set of a Delaunay triangulation of ( n ) points in the plane. Such a good order makes reconstruction in ( O(n) ) time with a simple algorithm possible. In contrast to the algorithm of Snoeyink and van Kreveld cite1, which is based on independent sets, our algorithm uses a breadth first search (BFS) to obtain these orders. Both approaches construct such orders by repeatedly removing a constant fraction of vertices from the current triangulation. The advantage of the BFS approach is that we can give significantly better bounds on the fraction of removed points in a phase of the algorithm. We can prove that a single phase of our algorithm removes at least ( frac13 ) of the points, even if we restrict the degree of the points (at the time they are removed) to 6. We implemented and compared both algorithms. Our algorithms is slightly faster and achieves about 15% better vertex data compression when using a simple variable length code to encode the differences between two consecutive vertices of the given order.}, author = {Sohler, Christian}, booktitle = {Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG'99)}, pages = {136--141}, title = {{Fast Reconstruction of Delaunay Triangulations}}, year = {1999}, } @book{19017, abstract = {Neuausgabe als E-Book: Stuttgart 2015}, author = {Eke, Norbert Otto}, pages = {325}, publisher = {Reclam}, title = {{Heiner Müller}}, year = {1999}, } @article{19404, abstract = {Angabe zur Herausgeberschaft: hg. von Frank Hörnigk}, author = {Eke, Norbert Otto}, journal = {Zeitschrift für deutsche Philologie}, number = {H. 4}, pages = {624--631}, title = {{Heiner Müller, Die Gedichte}}, volume = {118}, year = {1999}, } @misc{19461, author = {Eke, Norbert Otto}, booktitle = {Reclams Romanlexikon. Bd. 2: Von der Romantik bis zum Naturalismus}, editor = {Max, Frank Rainer and Ruhrberg, Christine}, pages = {235--238}, publisher = {Reclam}, title = {{Nikolaus Lenau: Savonarola. Ein Gedicht; Die Albigenser. Freie Dichtungen}}, year = {1999}, } @misc{19473, author = {Eke, Norbert Otto}, booktitle = {Reclams Romanlexikon. Bd. 3: 20. Jahrhundert I}, editor = {Max, Frank Rainer and Ruhrberg, Christine}, pages = {85--87}, publisher = {Reclam}, title = {{Richard Beer-Hofmann: Der Tod Georgs}}, year = {1999}, } @inproceedings{2165, author = {Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}, booktitle = {SPAA}, pages = {33----42}, title = {{Simple Competitive Request Scheduling Strategies}}, year = {1999}, } @article{19815, author = {Kleine Büning, Hans and Lettmann, Theodor}, issn = {0166-218X}, journal = {Discrete Applied Mathematics}, pages = {139--148}, title = {{Resolution remains hard under equivalence}}, doi = {10.1016/s0166-218x(99)00055-4}, year = {1999}, } @inproceedings{19928, abstract = {Mai 1999}, author = {Büker, Petra}, title = {{Europaoffenes Lernen mit Grundschulkindern oder: Europa beginnt in der Primarstufe. Arbeitsgruppe im Rahmen des Symposiums: „Bildungsprojekt ‚Europa’ in der universitären Lehrerausbildung. Standortvergewisserung. Perspektivenentwicklung. Erfahrungspräsentation“. Universität Münster}}, year = {1999}, } @inproceedings{20956, author = {Hahn, O. and Kurzok, J. and Meschut, Gerson and Schulte, V.}, booktitle = {Tagungsband 726 zum Forschungskolleg Stahlanwendung ´99}, location = {Düsseldorf}, title = {{Fügen durch Umformen – Fertigungstechniken für die Blechverarbeitung der Zukunft – Stand der Technik und Entwicklungstendenzen}}, volume = {726}, year = {1999}, } @inproceedings{20987, author = {Meschut, Gerson}, booktitle = {Tagungsband zur Vortragsveranstaltung “75 Jahre schweißtechnische Ausbildung in Braunschweig”}, location = {Braunschweig}, title = {{Kleben – eine innovative Fügetechnik für den Leichtbau}}, year = {1999}, } @article{22320, author = {Zimmer, Detmar}, journal = {Der Konstrukteur - Magazin für Konstruktion und Entwicklung (ASB)}, publisher = {Vereinigte Fachverlage GmbH}, title = {{Kleiner Antrieb, große Wirkung}}, year = {1999}, } @inproceedings{11780, abstract = {We apply Fisher variate analysis to measure the effectiveness of speaker normalization techniques. A trace criterion, which measures the ratio of the variations due to different phonemes compared to variations due to different speakers, serves as a first assessment of a feature set without the need for recognition experiments. By using this measure and by recognition experiments we demonstrate that cepstral mean normalization also has a speaker normalization effect, in addition to the well-known channel normalization effect. Similarly vocal tract normalization (VTN) is shown to remove inter-speaker variability. For VTN we show that normalization on a per sentence basis performs better than normalization on a per speaker basis. Recognition results are given on Wall Street Journal and Hub-4 databases}, author = {Haeb-Umbach, Reinhold}, booktitle = {ICASSP99 Phoenix, AZ}, title = {{Investigations on inter-speaker variability in the feature space}}, year = {1999}, } @inproceedings{11805, abstract = {In transcription of broadcast news, dividing the signal into homogeneous segments, and clustering together similar segments is important. Decoding a complete broadcast news program in one chunk is technically di cult. Also, through creation of homogeneous clusters of segments, improvement from adaptation can be increased. Two systems of segmentation and clustering are compared. The best system used the BIC algorithm to produce long, homogeneous segments, and a nearest neighbour bottom-up agglomerative clustering algorithm to produce homogeneous clusters. Adaptation brought a word error rate (WER) improvement from 23:4% to 21:0% using the automatic segmentation and clustering, compared to an improvement from 21:8% to 20:0% using a handmade \correct" segmentation and clustering.}, author = {Harris, Matthew J. and Aubert, Xavier L. and Haeb-Umbach, Reinhold and Beyerlein, Peter}, booktitle = {Eurospeech}, title = {{A study of broadcast news audio stream segmentation and segment clustering}}, year = {1999}, }