Find:

Searching for PHRASE language h.

Restrict to:   Header   Title   Order by:   Expected citations   Hubs   Usage   Date   Try:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP
100 documents found. Order: number of citations.

Analysis and Efficient Implementation of Functional Programs - Sestoft (1991)   (Correct)   (43 citations)
: 98 7.2 The strict language H :
and fail to under strict evaluation. A language has lazy data structures if the arguments of a
APPLICATIONS 7.2.5 Closure analysis for the H language Our method for doing liveness and interference
www.dina.kvl.dk/~sestoft/papers/sestoft-thesis-1991.ps

A Road-map on Complexity for Hybrid Logics - Areces, Blackburn, Marx (1999)   (Correct)   (26 citations)
the syntax and semantics of the basic hybrid language H(the weakest language we shall consider in
or multiple modalities to do this. 4.1 The language H(Let's rst make the syntax and semantics
turing.wins.uva.nl/~marx/pub/abstracts/../csl99.ps.gz

Tractable Induction and Classification in First Order .. - Michèle.. (1997)   (Correct)   (17 citations)
H(E) is intractable even within a propositional language: H(E) is characterized by its lower bound (S =E)
www.eeaax.polytechnique.fr/papers/michele/ijcai97.ps.gz

The Undecidability of Simultaneous Rigid E-Unification - Degtyarev, Voronkov (1995)   (Correct)   (14 citations)
that L 2 stands for a fixed second-order language h\Sigma X Wi. Definition 2 The set T (L 2
assume that L 1 stands for a fixed first-order language h\Sigma X i. Definition 7 The set T (L 1
www.csd.uu.se/~anatoli/Papers/tcs_rigid.ps

Decentralized Supervisory Control of Discrete-Event Systems .. - Wong, van Schuppen (1996)   (Correct)   (13 citations)
j su 2 H for some u 2 \Sigma g: The language H is prefix-closed if H =H. The language L(G) is
Section 3 in a slightly more general form. For a language H over \Sigma let Elig H :Sigma Gamma! P
ftp.cwi.nl/pub/CWIreports/BS/BS-R9606.ps.Z

Learning Acyclic First-order Horn Sentences From Entailment - Arimura (1997)   (Correct)   (11 citations)
Horn programs In this section, we introduce our language H of first-order Horn programs. For any set S,
programs Let A be the set of all atoms of our language H and ?be a preorder (transitive binary
robin.i.kyushu-u.ac.jp/~arim/papers/arimura-alt97.ps.gz

Weakly Hard Problems - Jack Lutz Department (1994)   (Correct)   (10 citations)
linear According to standard terminology, a language H is P m -hard for E if the set Pm (H)
is also an element of E. Generalizing this, a language H is weakly P m -hard for E if the set Pm (H)
www.cs.iastate.edu/~lutz/=PAPERS/whp.ps

Topic Adaptation For Language Modeling Using.. - Chen, Seymore, Rosenfeld (1998)   (Correct)   (10 citations)
history (or previous words in the sentence) is h. Language models have many applications, most notably in
www.cs.cmu.edu/~sfc/html/../papers/d016a.ps.gz

A Classification System for Visual Programming Languages - Burnett, Baker (1994)   (Correct)   (9 citations)
ways of classifying VPLs are provided within VPL H: Language Classifications. In some cases, an author may
ftp.cs.orst.edu/pub/burnett/VPLclassification.JVLC.Sept94.pdf

Expected Error Analysis for Model Selection - Scheffer, Joachims (1999)   (Correct)   (8 citations)
algorithms stratify the potential hypothesis language H into subsets (models"H 1 H 2 ae H
We assume the existence of a given hypothesis language H which may be infinite and may even have an
www.informatik.hu-berlin.de/~scheffer/publications/icml99.ps

Algorithms and Complexity for Annotated Sequence Analysis - Evans (1999)   (Correct)   (8 citations)
automaton construction for the suffix-closed language H 4 (L(a(ba) b)
regular language L, the L-subsequence annotated language H 1 :R \Theta C !P (Sigma \Theta (C [f0g)is
www.cs.unb.ca/profs/pevans/research/pae-thesis.ps

Estimating the Expected Error of Empirical Minimizers for.. - Scheffer, Joachims (1998)   (Correct)   (7 citations)
algorithms stratify the potential hypothesis language H into subsets (models"H 1 H 2 :ae H.
We assume the existence of a given hypothesis language H which may be infinite and may even have an
www.informatik.hu-berlin.de/~scheffer/publications/eed-report.ps

Exploiting Thesaurus Knowledge in Rule Induction for Text.. - Junker, Abecker (1997)   (Correct)   (6 citations)
represented background knowledge. Our hypothesis language H contains each boolean expression over words and
www.dfki.uni-kl.de/~junker/download/ranlp97.ps

First 20 documents  Next 20

Try your query at:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP

CiteSeer.IST - Copyright Penn State and NEC