Sciweavers

4211 search results - page 213 / 843
» Types as Abstract Interpretations
Sort
View
TLCA
2009
Springer
15 years 11 months ago
Algebraic Totality, towards Completeness
Finiteness spaces constitute a categorical model of Linear Logic whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefsc...
Christine Tasson
MICS
2008
87views more  MICS 2008»
15 years 4 months ago
Spurious Disambiguation Errors and How to Get Rid of Them
The disambiguation approach to the input of formulae enables users of mathematical assistants to type correct formulae in a terse syntax close to the usual ambiguous mathematical n...
Claudio Sacerdoti Coen, Stefano Zacchiroli
ICPR
2000
IEEE
16 years 5 months ago
Unsupervised Selection and Estimation of Finite Mixture Models
We propose a new method for fitting mixture models that performs component selection and does not require external initialization. The novelty of our approach includes: a minimum ...
Anil K. Jain, Mário A. T. Figueiredo
DAARC
2009
Springer
268views Algorithms» more  DAARC 2009»
15 years 11 months ago
Binding without Identity: Towards a Unified Semantics for Bound and Exempt Anaphors
Expressions such as English himself are interpreted as locally bound anaphors in certain syntactic environments and are exempt from the binding conditions in others. This article p...
Eric Reuland, Yoad Winter
IEEEIAS
2007
IEEE
15 years 10 months ago
Modeling Security Protocols as Games
We model security protocols as a game tree using concepts of game semantics. The model interprets protocol specifications as strategies over a game tree that represents the type ...
Mohamed Saleh, Mourad Debbabi