ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (4)
  • algorithms  (4)
  • Springer  (4)
  • American Chemical Society
  • American Chemical Society (ACS)
  • American Geophysical Union
  • Frontiers Media
  • Institute of Electrical and Electronics Engineers (IEEE)
  • MDPI
  • National Academy of Sciences
  • 2015-2019
  • 2005-2009
  • 1990-1994
  • 1980-1984  (4)
  • 2017
  • 2009
  • 1983  (4)
  • Computer Science  (4)
Collection
  • Articles  (4)
Source
Keywords
Publisher
  • Springer  (4)
  • American Chemical Society
  • American Chemical Society (ACS)
  • American Geophysical Union
  • Frontiers Media
    • +
Years
  • 2015-2019
  • 2005-2009
  • 1990-1994
  • 1980-1984  (4)
Year
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Variable metric methods for linearly constrained nonlinear minimax approximation (1983)
    Springer
    Computing 30 (1983), S. 315-334 
    Details
    ISSN: 1436-5057
    Keywords: Linearly constrained optimization ; nondifferentiable optimization ; nonlinear minimax approximation ; variable metric methods ; algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Dieser Beitrag enthält die Beschreibung neuer Methoden für die diskrete nichtlineare Minimax-Approximation mit linearen Restriktionen. Diese Methoden sind Verallgemeinerungen der Subgradientenmethode des stärksten Abstiegs von Demyanov und Malozemov. Die Methoden benutzen die Verbesserung der variablen Metrik. Letztlich ist der kombinierteLP- undVM-Algorithmus beschrieben und seine Effizienz demonstriert.
    Notes: Abstract This contribution contains a description of a new class of methods for linearly constrained discrete nonlinear minimax approximation. These methods are generalizations of a subgradient steepest descent method of Demyanov and Malozemov and they use variable metric updates. Finally a combinedLP andVM Algorithm is described and its efficiency is demonstrated.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02242138
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Applications of a two-dimensional hidden-line algorithm to other geometric problems (1983)
    Springer
    Computing 31 (1983), S. 191-202 
    Details
    ISSN: 1436-5057
    Keywords: 52.A30 ; 52.A10 ; Visibility ; simple polygon ; convex hull ; triangulation ; L-convex polygon ; edge visible polygon ; geometric complexity ; algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Kürzlich haben ElGindy und Avis (EA) einenO(n)-Algorithmus zur Lösung des Problems der verdeckten Linien in einem überschneidungsfreien Polygon vorgelegt. Hier zeigen wir, daß ihr Algorithmus auch zur Lösung anderer geometrischer Probleme verwendet werden kann. Insbesondere können wir einL-konvexes Polygon in der ZeitO(n) triangulieren und die konvexe Hülle eines überschneidungsfreien Polygons in der gleichen Zeit finden. Ferner kann die Überprüfung eines überschneidungsfreien Polygons aufL-Konvexität in der ZeitO (n2) erfolgen.
    Notes: Abstract Recently ElGindy and Avis (EA) presented anO(n) algorithm for solving the two-dimensional hidden-line problem in ann-sided simple polygon. In this paper we show that their algorithm can be used to solve other geometric problems. In particular, triangulating anL-convex polygon and finding the convex hull of a simple polygon can be accomplished inO(n) time, whereas testing a simple polygon forL-convexity can be done inO(n 2) time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02263430
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Computationally efficient algorithms for a one-time pad scheme (1983)
    Springer
    International journal of parallel programming 12 (1983), S. 285-316 
    Details
    ISSN: 1573-7640
    Keywords: Cryptography ; ciphers ; security ; algorithms ; data protection ; cryptology ; one-time pads
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The use of cryptography for data protection has received a great deal of attention in recent years. This paper presents computationally efficient algorithms for the implementation of a one-time pad scheme. The algorithms to encipher and decipher text were implemented on aPDP-11 computer using the programming languageC. To study the behavior of the keys used to encipher and decipher text, we used the chi-square method, and the test results of two runs are presented with some statistical analysis.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00991623
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Computing largest empty circles with location constraints (1983)
    Springer
    International journal of parallel programming 12 (1983), S. 347-358 
    Details
    ISSN: 1573-7640
    Keywords: Largest empty circle ; facility location ; polygons ; Voronoi diagram ; algorithms ; complexity ; operations research ; computational geometry
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract LetQ = {q1, q2,..., qn} be a set ofn points on the plane. The largest empty circle (LEG) problem consists in finding the largest circleC with center in the convex hull ofQ such that no pointq i εQ lies in the interior ofC. Shamos recently outlined anO(n logn) algorithm for solving this problem.(9) In this paper it is shown that this algorithm does not always work correctly. A different approach is proposed here and shown to also result in anO(n logn) algorithm. The new approach has the advantage that it can also solve more general problems. In particular, it is shown that if the center ofC is constrained to lie in an arbitrary convexn-gon, an0(n logn) algorithm can still be obtained. Finally, an0(n logn +k logn) algorithm is given for solving this problem when the center ofC is constrained to lie in an arbitrary simplen-gonP. wherek denotes the number of intersections occurring between edges ofP and edges of the Voronoi diagram ofQ andk ⩽O(n 2).
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01008046
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...