Sciweavers

2043 search results - page 68 / 409
» A convenient category of domains
Sort
View
ENTCS
2006
153views more  ENTCS 2006»
14 years 9 months ago
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
Lars Birkedal, Rasmus Ejlers Møgelberg, Ras...
FIW
2009
139views Communications» more  FIW 2009»
14 years 7 months ago
Problem-Solution Feature Interactions as Configuration Knowledge in Distributed Runtime Adaptations
Abstract. Current generative programming approaches use configuration knowledge to automatically manufacture an end product given a particular requirements specification. Such conf...
Frans Sanen, Eddy Truyen, Wouter Joosen
TSD
2001
Springer
15 years 2 months ago
Method for WordNet Enrichment Using WSD
This paper presents a new method to enrich semantically WordNet with categories from general domain classification systems. The method is performed in two consecutive steps. First,...
Andrés Montoyo, Manuel Palomar, German Riga...
CCR
2008
90views more  CCR 2008»
14 years 10 months ago
Censor networks: a critique of "sensor networks" from a systems perspective
This writeup presents a critique of the field of "Wireless Sensor Networks (WSNs)". Literature in this domain falls into two main, distinct categories: (1) algorithms or...
Bhaskaran Raman, Kameswari Chebrolu
RIA
2006
84views more  RIA 2006»
14 years 9 months ago
Learning Recursive Automata from Positive Examples
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
Isabelle Tellier