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  (118)
  • Parallel algorithms  (59)
  • classification  (59)
  • Springer  (118)
  • American Association for the Advancement of Science
  • Wiley
  • Computer Science  (118)
Collection
  • Articles  (118)
Source
Keywords
Publisher
  • Springer  (118)
  • American Association for the Advancement of Science
  • Wiley
Years
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Polling systems in heavy traffic: Exhaustiveness of service policies (1997)
    Springer
    Queueing systems 27 (1997), S. 227-250 
    Details
    ISSN: 1572-9443
    Keywords: polling systems ; heavy traffic ; expected delay ; exhaustiveness ; monotonicity ; service disciplines ; classification
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1019118232492
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    The Automatic Deduction of Classificatory Systems from Linguistic Theories (1998)
    Springer
    Grammars 1 (1998), S. 103-153 
    Details
    ISSN: 1572-848X
    Keywords: classification ; constraint grammars ; knowledge management
    Source: Springer Online Journal Archives 1860-2000
    Topics: Linguistics and Literary Studies , Computer Science
    Notes: Abstract Classifying linguistic objects is a widespread and important linguistic task, but hand deducing a classificatory system from a general linguistic theory can consume much effort and introduce pernicious errors. We present an abstract prototype device that effectively deduces an accurate classificatory system from a finite linguistic theory.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009909418521
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    A computer-aided methodology for the analysis and classification of British-Canadian children's traditional singing games (1988)
    Springer
    Computers and the humanities 22 (1988), S. 173-182 
    Details
    ISSN: 1572-8412
    Keywords: singing games ; songs ; folk songs ; analysis ; style ; computer-aided ; Kodály ; Bartók ; melodic patterns ; classification
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Abstract To structure a music education program in Canada based on the Hungarian model, Bartók's “grammatical principle” was adopted to define the musical characteristics of British-Canadian children's traditional songs. A computer-aided methodology analyzed a sample of singing games from a personal collection to identify 4-phrase variants, and extracted and tabulated by phrasal position their common phrase patterns of equal length. Future programs will complete the phrase analysis and analyze other musical characteristics, grouping variants successively to determine the styles of the entire collection.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00118890
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Shakespeare vs. fletcher: A stylometric analysis by radial basis functions (1995)
    Springer
    Computers and the humanities 29 (1995), S. 449-461 
    Details
    ISSN: 1572-8412
    Keywords: neural networks ; stylometric analysis ; Shakespeare ; Fletcher ; discrimination ; classification
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Abstract In this paper we show, for the first time, how Radial Basis Function (RBF) network techniques can be used to explore questions surrounding authorship of historic documents. The paper illustrates the technical and practical aspects of RBF's, using data extracted from works written in the early 17th century by William Shakespeare and his contemporary John Fletcher. We also present benchmark comparisons with other standard techniques for contrast and comparison.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01829876
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Towards a Winograd/Flores semantics (1995)
    Springer
    Minds and machines 5 (1995), S. 69-87 
    Details
    ISSN: 1572-8641
    Keywords: Meaning ; reference ; disjunction problem ; situation theory ; synonymy ; classification ; causal theory of reference ; co-ordination
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract A basic theme of Winograd and Flores (1986) is that the principal function of language is to co-ordinate social activity. It is, they claim, from this function that meaning itself arises. They criticise approaches that try to understand meaning through the mechanisms of reference, the Rationalist Tradition as they call it. To seek to ground meaning in social practice is not new, but the approach is presently attractive because of difficulties encountered with the notion of reference. Without taking a view on whether these are insuperable, the present paper accepts Winograd and Flores' challenge and attempts to lay aside reference and to base a conception of meaning directly in terms of co-ordination and consensus within a linguistic community.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00974190
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Fast massively parallel algorithms for shortest path within planar figures (1996)
    Springer
    The visual computer 12 (1996), S. 484-502 
    Details
    ISSN: 1432-2315
    Keywords: Key words: Shortest path ; Depth search machines ; Parallel algorithms ; Distributed algorithms ; n-CCS ; Near edge
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: s and t within a given planar figure F is considered. The approach contains basic methodology developed for any parallel or distributed system. The 2D scene or the edge of F are represented in the n Cartesian coordinate system (n-CCS). Several algorithms for the shortest path are given, each one to be applied in specified circumstances depending on the exact machine model or on additional information concerning geometrical properties of the figure. If these algorithms are implemented in a parallel depth search machine (PDSM), then the shortest path can be computed in time O(1). The maximum number of processors used is 0(n). The given methodology can also be adapted for producing an approximate solution when the shortest path is approximated by polygonal lines.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s003710050081
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Parallel algorithms for shortest path problems in polygons (1988)
    Springer
    The visual computer 3 (1988), S. 371-378 
    Details
    ISSN: 1432-2315
    Keywords: Computational Geometry ; Parallel algorithms ; Simple polygon ; Shortest path
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Given ann-vertex simple polygon we address the following problems: (i) find the shortest path between two pointss andd insideP, and (ii) compute the shortestpath tree between a single points and each vertex ofP (which implicitly represents all the shortest paths). We show how to solve the first problem inO(logn) time usingO(n) processors, and the more general second problem inO(log2 n) time usingO(n) processors, and the more general second problem inO(log2 n) time usingO(n) processors for any simple polygonP. We assume the CREW RAM shared memory model of computation in which concurrent reads are allowed, but no two processors should attempt to simultaneously write in the same memory location. The algorithms are based on the divide-and-conquer paradigm and are quite different from the known sequential algorithms
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01901194
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Performance of scanline algorithms for direct display of CSG (1994)
    Springer
    The visual computer 10 (1994), S. 317-329 
    Details
    ISSN: 1432-2315
    Keywords: Graphics performance ; Display algorithms ; Scanline algorithms ; Parallel algorithms ; Solid modelling ; CSG models ; Polygonal and exact models
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Direct display algorithms display a CSG model without first converting the model into a boundary representation. Three such algorithms are described. All three are based on the scanline display algorithm, and are able to handle both polygonal and quadratic faces. The first algorithm is based on Atherton's recursive subdivision scanline algorithm, the second is a combination of a scanline and a ray casting algorithm, and the third is a scanline version of the Trickle algorithm. A multiprocessor system in which these algorithms can be incorporated is also described. The performances of the algorithms are compared. It turns out that the algorithms efficiently display CSG models on general-purpose architectures. A comparison is also made between the performances for polygon-approximated models and exact models for objects bounded by quadratic faces, such as spherical, cylindrical and conical faces, to get an indication of how many polygons can at most be used to approximate quadratic faces and still have better performance.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01900826
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Animation with fractals from variations on the Mandelbrot set (1987)
    Springer
    The visual computer 3 (1987), S. 23-26 
    Details
    ISSN: 1432-2315
    Keywords: Animation ; Fractals ; Parallel algorithms ; Graphics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The results of experimenting with a most interesting variation on the iteration formula which generates the Mandelbrot set are presented. Varying the powerm of the generating function results in fractal surfaces exhibiting self-similarity and suggesting smooth evolution under animation. One such sequence led to a mathematical conjecture, which has since been mathematically proven (Hubbard et al. 1986), illustrating the interaction between computer graphics and fractal geometry. Finally, we offer an extension of adapting fractal graphics algorithms to massively parallel computers.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02153648
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Solving visibility and separability problems on a mesh-of-processors (1988)
    Springer
    The visual computer 3 (1988), S. 356-370 
    Details
    ISSN: 1432-2315
    Keywords: Computational geometry ; Mesh-of-Processors ; Parallel algorithms ; Separability-Visibility
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper we study parallel algorithms for the Mesh-of-Processors architecture to solve visibility and related separability problems for sets of simple polygons in the plane. In particular, we present the following algorithms: - AnO( $$\sqrt N$$ time algorithm for computing on a Mesh-of-Processors of size N the visibility polygon from a point located in anN-vertex polygon, possibly with holes. -O( $$\sqrt N$$ ) time algorithms for computing on a Mesh-of-Processors of sizeN the set of all points on the boundary of anN-vertex polygonP which are visible in a given directiond as well as the visibility hull ofP for a given directiond. - AnO( $$\sqrt N$$ ) time algorithm for detecting on a Mesh-of-Processors of size 2N whether twoN-vertex polygons are separable in a given direction and anO( $$\sqrt {MN}$$ ) time algorithm for detecting on a Mesh-of-Processors of sizeMN whetherM N-vertex polygons are sequentially separable in a given direction. All proposed algorithms are asymptotically optimal (for the Mesh-of-Processors) with respect to time and number of processors.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01901193
    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...