Results 1 - 10
of
7,886
One-reversal counter machines and multihead automata: revisited
"... bounded language; inclusion; incomparability ..."
An Efficient Context-Free Parsing Algorithm
, 1970
"... A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; i ..."
Abstract
-
Cited by 798 (0 self)
- Add to MetaCart
; it has an n 2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical context-free programming language grammars. In an empirical comparison it appears to be superior to the top-down and bottom-up algorithms studied by Griffiths
Model checking and abstraction
- ACM Transactions on Programming Languages and Systems
, 1994
"... software developers are using the Java language as the language of choice on many applications. This is due to the effective use of the object-oriented (OO) paradigm to develop large software projects and the ability of the Java language to support the increasing use of web technologies in business ..."
Abstract
-
Cited by 742 (55 self)
- Add to MetaCart
applications. The recent release of the Java version 5.0 has further increased its popularity due to the inclusion of new features that exist in other OO languages. The transition from Java 1.4.x to Java 1.5.x has provided the programmer with more flexibility when implementing programs in Java. In this paper
Quantum complexity theory
- in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract
-
Cited by 574 (5 self)
- Add to MetaCart
be implemented and introduce some new, purely quantum mechanical primitives, such as changing the computational basis and carrying out an arbitrary unitary transformation of polynomially bounded dimension. We also consider the precision to which the transition amplitudes of a quantum Turing machine need
K-theory for operator algebras
- Mathematical Sciences Research Institute Publications
, 1998
"... p. XII line-5: since p. 1-2: I blew this simple formula: should be α = −〈ξ, η〉/〈η, η〉. p. 2 I.1.1.4: The Riesz-Fischer Theorem is often stated this way today, but neither Riesz nor Fischer (who worked independently) phrased it in terms of completeness of the orthogonal system {e int}. If [a, b] is a ..."
Abstract
-
Cited by 558 (0 self)
- Add to MetaCart
] is a bounded interval in R, in modern language the original statement of the theorem was that L 2 ([a, b]) is complete and abstractly isomorphic to l 2. According to [Jah03, p. 385], the name “Hilbert space ” was first used in 1908 by A. Schönflies, apparently to refer to what we today call l 2. Von
Climate and atmospheric history of the past 420,000 years from the Vostok ice core,
- Antarctica. Nature
, 1999
"... Antarctica has allowed the extension of the ice record of atmospheric composition and climate to the past four glacial-interglacial cycles. The succession of changes through each climate cycle and termination was similar, and atmospheric and climate properties oscillated between stable bounds. Inte ..."
Abstract
-
Cited by 716 (15 self)
- Add to MetaCart
Antarctica has allowed the extension of the ice record of atmospheric composition and climate to the past four glacial-interglacial cycles. The succession of changes through each climate cycle and termination was similar, and atmospheric and climate properties oscillated between stable bounds
Extensional versus intuitive reasoning: The conjunction fallacy in probability judgment
- Psychological Review
, 1983
"... Perhaps the simplest and the most basic qualitative law of probability is the conjunction rule: The probability of a conjunction, P(A&B), cannot exceed the probabilities of its constituents, P(A) and.P(B), because the extension (or the possibility set) of the conjunction is included in the exten ..."
Abstract
-
Cited by 461 (6 self)
- Add to MetaCart
in the extension of its constituents. Judgments under uncertainty, however, are often mediated by intuitive heuristics that are not bound by the conjunction rule. A conjunction can be more representative than one of its constituents, and instances of a specific category can be easier to imagine or to retrieve than
Making the future safe for the past: Adding Genericity to the Java Programming Language
, 1998
"... We present GJ, a design that extends the Java programming language with generic types and methods. These are both explained and implemented by translation into the unextended language. The translation closely mimics the way generics are emulated by programmers: it erases all type parameters, maps ty ..."
Abstract
-
Cited by 372 (16 self)
- Add to MetaCart
We present GJ, a design that extends the Java programming language with generic types and methods. These are both explained and implemented by translation into the unextended language. The translation closely mimics the way generics are emulated by programmers: it erases all type parameters, maps
Fixing the Java memory model
- In ACM Java Grande Conference
, 1999
"... This paper describes the new Java memory model, which has been revised as part of Java 5.0. The model specifies the legal behaviors for a multithreaded program; it defines the semantics of multithreaded Java programs and partially determines legal implementations of Java virtual machines and compile ..."
Abstract
-
Cited by 385 (10 self)
- Add to MetaCart
and compilers. The new Java model provides a simple interface for correctly synchronized programs – it guarantees sequential consistency to data-race-free programs. Its novel contribution is requiring that the behavior of incorrectly synchronized programs be bounded by a well defined notion of causality
Visual Recognition of American Sign Language Using Hidden Markov Models
, 1995
"... Using hidden Markov models (HMM's), an unobstrusive single view camera system is developed that can recognize hand gestures, namely, a subset of American Sign Language (ASL). Previous systems have concentrated on finger spelling or isolated word recognition, often using tethered electronic glov ..."
Abstract
-
Cited by 348 (14 self)
- Add to MetaCart
Using hidden Markov models (HMM's), an unobstrusive single view camera system is developed that can recognize hand gestures, namely, a subset of American Sign Language (ASL). Previous systems have concentrated on finger spelling or isolated word recognition, often using tethered electronic
Results 1 - 10
of
7,886