Sciweavers

877 search results - page 19 / 176
» Full Abstraction for HOPLA
Sort
View
ENTCS
2007
86views more  ENTCS 2007»
13 years 7 months ago
Sequentiality and the CPS Semantics of Fresh Names
We investigate the domain-theoretic denotational semantics of a CPS with fresh name declaration. This is the target of a fully abstract CPS translation from the nu-calculus with ï...
James Laird
COMBINATORICS
2000
96views more  COMBINATORICS 2000»
13 years 7 months ago
Automorphisms and Enumeration of Switching Classes of Tournaments
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...
László Babai, Peter J. Cameron
EUNIS
2001
13 years 9 months ago
Moving forward in e-business / Distribution of scientific content via intermediaries
preferred abstracting and indexing databases to full text. Librarians and information professionals want the choice to be able to purchase subject orientated packages of electronic...
Meinhard Kettler
PRIS
2004
13 years 8 months ago
A Pitfall in Determining the Optimal Feature Subset Size
Abstract. Feature selection researchers often encounter a peaking phenomenon: a feature subset can be found that is smaller but still enables building a more accurate classifier th...
Juha Reunanen
CORR
2007
Springer
96views Education» more  CORR 2007»
13 years 7 months ago
Edit and verify
Abstract. Automated theorem provers are used in extended static checking, where they are the performance bottleneck. Extended static checkers are run typically after incremental ch...
Radu Grigore, Michal Moskal