1458 search results - page 43 / 292 » Monads for incremental computing |
104
Voted
CORR
1998
Springer
15 years 2 months ago
1998
Springer
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a re...
118
Voted
CONCUR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We introduce a novel way to integrate functional and concurrent programming based on intuitionistic linear logic. The functional core arises from interpreting proof reduc...
92
Voted
HRI
2007
ACM
15 years 6 months ago
2007
ACM
Robots that interact with humans face-to-face using natural language need to be responsive to the way humans use language in those situations. We propose a psychologicallyinspired...
128
Voted
IAT
2010
IEEE
15 years 15 days ago
2010
IEEE
Computational trust systems are getting popular in several domains such as social networks, grid computing and business-to-business systems. However, the estimation of the trustwo...
132
Voted
GD
1995
Springer
15 years 6 months ago
1995
Springer
Abstract. Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental la...