Sciweavers

1143 search results - page 98 / 229
» Mental models of recursion
Sort
View
IJSR
2010
107views more  IJSR 2010»
13 years 7 months ago
Multi-model Hypothesis Group Tracking and Group Size Estimation
Abstract— People in densely populated environments typically form groups that split and merge. In this paper we track groups of people so as to reflect this formation process an...
Boris Lau, Kai Oliver Arras, Wolfram Burgard
WDAG
2001
Springer
76views Algorithms» more  WDAG 2001»
14 years 1 months ago
An Effective Characterization of Computability in Anonymous Networks
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, a...
Paolo Boldi, Sebastiano Vigna
STOC
1994
ACM
108views Algorithms» more  STOC 1994»
14 years 1 months ago
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
Russell Impagliazzo, Noam Nisan, Avi Wigderson
OWLED
2007
13 years 10 months ago
On Querying Ontologies with Contextual Logic Programming
Abstract. We describe a system in which Contextual Logic Programming is used as a mediator for knowledge modeled by ontologies. Our system provides the components required to behav...
Cláudio Fernandes, Nuno Lopes 0002, Salvado...
ENTCS
2007
126views more  ENTCS 2007»
13 years 9 months ago
Notes on Generative Probabilistic Bisimulation
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we ...
Simone Tini