Sciweavers

1350 search results - page 117 / 270
» Generalized Committed Choice
Sort
View
JOLLI
2006
86views more  JOLLI 2006»
15 years 4 months ago
Types as Graphs: Continuations in Type Logical Grammar
Applying the programming-language concept of continuations, we propose a new multimodal analysis of quantification in Type Logical Grammar. Our approach naturally gives rise to a n...
Chris Barker, Chung-chieh Shan
126
Voted
NETWORK
2008
100views more  NETWORK 2008»
15 years 4 months ago
Distributed connectivity service for a SIP infrastructure
Because of the constant reduction of available public network addresses and the necessity to secure networks, devices like Network Address Translators and firewalls have become qui...
Luigi Ciminiera, Guido Marchetto, Fulvio Risso, Li...
IJIS
2007
93views more  IJIS 2007»
15 years 4 months ago
Perspectives on ontology-based querying
In this paper, we introduce principles for ontology-based querying of information bases. We consider a framework in which a basis ontology over atomic concepts in combination with ...
Rasmus Knappe, Henrik Bulskov, Troels Andreasen
TCS
2008
15 years 4 months ago
Seminormal rings (following Thierry Coquand)
The Traverso-Swan theorem says that a reduced ring A is seminormal if and only if the natural homomorphism Pic A Pic A[X] is an isomorphism ([18, 17]). We give here all the detai...
Henri Lombardi, Claude Quitté
104
Voted
TNN
2008
82views more  TNN 2008»
15 years 4 months ago
Deterministic Learning for Maximum-Likelihood Estimation Through Neural Networks
In this paper, a general method for the numerical solution of maximum-likelihood estimation (MLE) problems is presented; it adopts the deterministic learning (DL) approach to find ...
Cristiano Cervellera, Danilo Macciò, Marco ...