Sciweavers

4131 search results - page 214 / 827
» Compactness in Topology and Computation
Sort
View
DALT
2004
Springer
15 years 12 months ago
A Lightweight Coordination Calculus for Agent Systems
The concept of a social norm is used in multi-agent systems to specify behaviours required of agents interacting in a given social context. We describe a method for specifying soci...
David Robertson
COLING
1996
15 years 7 months ago
An Underspecified HPSG Representation for Information Structure
hfformation structure can be of great use in linguistic applications, especially in those involving a speech component. However, focus marking by prosody is often ambiguous. Exist...
Jonas Kuhn
ENTCS
2010
112views more  ENTCS 2010»
15 years 6 months ago
From Coalgebraic to Monoidal Traces
The main result of this paper shows how coalgebraic traces, in suitable Kleisli categories, give rise to traced monoidal structure in those Kleisli categories, with finite coprodu...
Bart Jacobs
NN
2000
Springer
145views Neural Networks» more  NN 2000»
15 years 6 months ago
Best approximation by Heaviside perceptron networks
In Lp-spaces with p [1, ) there exists a best approximation mapping to the set of functions computable by Heaviside perceptron networks with n hidden units; however for p (1, ) ...
Paul C. Kainen, Vera Kurková, Andrew Vogt
ICPR
2008
IEEE
16 years 7 months ago
On efficient Viterbi decoding for hidden semi-Markov models
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
Bonnie K. Ray, Jianying Hu, Ritendra Datta