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
  • 1
    Electronic Resource
    Electronic Resource
    Machine-Assisted Pattern Classification in Medicine and Biology (1980)
    Palo Alto, Calif. : Annual Reviews
    Annual Review of Biophysics and Biomolecular Structure 9 (1980), S. 393-436 
    Details
    ISSN: 0084-6589
    Source: Annual Reviews Electronic Back Volume Collection 1932-2001ff
    Topics: Biology , Physics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1146/annurev.bb.09.060180.002141
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Sequential classification of strings generated by SCFG's (1975)
    Springer
    International journal of parallel programming 4 (1975), S. 205-217 
    Details
    ISSN: 1573-7640
    Keywords: Context-free grammars ; stochastic context-free grammars ; parsing ; classification ; sequential classification ; Earley's parser
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A sequential classification algorithm (SCA) for stochastic context-free languages is given. The algorithm is an extension of Earley's parsing algorithm for context-free languages. The SCA uses an optimum decision rule and a suboptimal stopping rule. The time bound is proportional ton 3 (n is the length of the string). A parametere* in the SCA allows an easy control over the probability of error. It is shown theoretically and experimentally that a considerable amount of processing time can be saved when using the SCA compared to the time required when using Earley's algorithm.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01007759
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Inferability of context-free programmed grammars (1984)
    Springer
    International journal of parallel programming 13 (1984), S. 33-58 
    Details
    ISSN: 1573-7640
    Keywords: Context-free programmed grammar ; control diagram ; formal autocorrelation ; grammatical inference ; inferability ; recursive structures ; syntactic pattern recognition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Context-free programmed grammars (CFPG) are considered powerful for string language description in syntactic pattern analysis. Recursive structures are the most important features of CFPG. The relations between CFPG and recursive language structures have been systematically studied and consequently a unique theory of CFPG inferability has been obtained by means of investigating recursion formats of basic recursive structures. According to the theory a CFPG can be constructed for a language if the sufficient and necessary conditions are satisfied.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00989482
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Long-path monitoring of atmospheric pollutant gases (1976)
    Springer
    Optical and quantum electronics 8 (1976), S. 194-196 
    Details
    ISSN: 1572-817X
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology , Physics
    Notes: Summary Limitations of present laser techniques (1) Availability of suitable lasers. Most important factors are (a) tunability over the atmospheric window regions, (b) stability and (c) long-term operating characteristics. (2) Atmospheric turbulence, which limits detection sensitivity. (3) Interferences, which limit selectivity. (4) Portability and costs, which severely limit utilization. Implications for instrumentation technology (1) Improved sensitivity of the detection/analysis system is required, including use of optical enhancement techniques, where applicable, by longer (or multiple) optical paths. (2) Elimination or minimization of interference effects by better spectral selection, primarily by use of multiple lines. (3) Tunable lasers which can be tuned over wider spectral regions, covering all windows are essential. (4) More information is needed to better characterize atmospheric turbulence in order that instrumentation may be designed to overcome the limitations it imposes.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00619446
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Pattern recognition: a potential tool for data analysis in atmospheric laser spectroscopy (1976)
    Springer
    Optical and quantum electronics 8 (1976), S. 169-183 
    Details
    ISSN: 1572-817X
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology , Physics
    Notes: Abstract The problem of pattern recognition is introduced and several major techniques in statistical pattern recognition are described. Data analysis in atmospheric laser spectroscopy could be viewed as a pattern recognition problem when the exact functional relationships between various atmospheric situations and spectral measurements are unknown. This paper tries to illustrate the use of pattern recognition as a potential tool to solve this class of data analysis problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00619442
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Stochastic grammars and languages (1972)
    Springer
    International journal of parallel programming 1 (1972), S. 135-170 
    Details
    ISSN: 1573-7640
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper summarizes some recent results concerned with the extension of formal languages to their corresponding stochastic versions. Weighted grammars and languages are first defined, and stochastic grammars and languages are defined as a special case of weighted grammars and languages. Fuzzy grammars and languages, which have some properties similar to weighted grammars and languages, are also discussed. Stochastic automata are defined from the language recognition viewpoint. Languages accepted by stochastic finite-state and pushdown automata, with and without a cutpoint, are studied. Weighted and stochastic programmed and indexed grammars, and stochastic nested stack automata are defined. Finally, some decidability problems of stochastic (weighted, fuzzy) languages are discussed, and problems for further research are suggested.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00995736
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Inference of a class of CFPG by means of semantic rules (1982)
    Springer
    International journal of parallel programming 11 (1982), S. 1-23 
    Details
    ISSN: 1573-7640
    Keywords: Binary tree ; context-free programmed grammar ; context-sensitive languages ; control diagram ; grammatical inference ; semantics ; semantic rule ; stochastic grammar ; syntactic pattern recognition ; tree grammar
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract An important property of Context-Free Programmed Grammars (CFPG) is that some context-sensitive Languages can be generated by CFPG. To infer a special class of CFPG for syntactic pattern recognition is the motivation of this paper. First an one-dimensional string is transformed into a corresponding binary tree. Then in terms of the structure of subtrees, and the semantic rules corresponding to the context-free productions, a method for the inference of Context-free Programmed Grammar is presented. Inference of Stochastic Context-Free Programmed Grammar (STCFPG) by the maximum-likelihood estimate approach is also discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00993198
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    An application of learning to robotic planning (1979)
    Springer
    International journal of parallel programming 8 (1979), S. 303-333 
    Details
    ISSN: 1573-7640
    Keywords: Intelligent control system ; problem solving ; procedural knowledge ; robotic planning ; supervised learning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Conventional approaches to robotic planning have focused on the resolution theorem prover, using general-purpose search heuristics, with the desired goal expressed in terms of logical calculus. These approaches suffer from several drawbacks; one major problem encountered in these approaches is the speed of planning. In this paper we describe an approach of applying supervised learning to robotic planning. The learning system is an intermediate one between rote learning and generalization learning, and is based on the concept of analogy. Simulation examples of various robot tasks are presented to demonstrate the significant increase in the systems's planning speed and to compare it with some existing systems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00993056
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    An error-correcting syntactic decoder for computer networks (1976)
    Springer
    International journal of parallel programming 5 (1976), S. 45-58 
    Details
    ISSN: 1573-7640
    Keywords: Syntactic decoding ; syntactic information source ; computer networks ; error-correcting parser ; formal languages ; context-free grammars ; information theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract An information source that generates messages with formal syntactic structures is proposed. It is modeled as a context-free grammar in Chomsky Normal Form. The messages are binary coded with or without error-correction capabilities, and are transmitted over a memoryless symmetric noisy channel. At the receiver, an algorithmic procedure is proposed for the correction of syntactic errors in the incoming messages. This is similar to the Cocke-Younger-Kasami parser with the additional capability of detecting and correcting syntactic errors in the input strings. Simulation results are presented which show that the present syntactic decoding scheme has a lower probability of decoding errors than conventional algebraic decoding schemes. Its performance is also compared with that of an alternate syntactic decoder studied recently.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00991071
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    facet.materialart.
    Unknown
    Image processing of seismograms: (a) Hough transformation for the detection of seismic patterns; (b) thinning processing in the seismogram (1985)
    Elsevier
    Details
    Publication Date: 1985-01-01
    Print ISSN: 0031-3203
    Electronic ISSN: 1873-5142
    Topics: Computer Science
    Published by Elsevier
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...