Sciweavers

1222 search results - page 43 / 245
» Some Results on Directable Automata
Sort
View
COGSCI
2010
160views more  COGSCI 2010»
14 years 9 months ago
Comprehension of Simple Quantifiers: Empirical Evaluation of a Computational Model
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same pr...
Jakub Szymanik, Marcin Zajenkowski
AAAI
2008
15 years 1 days ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
CORR
2011
Springer
160views Education» more  CORR 2011»
14 years 1 months ago
Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
Silvia Acid, Luis M. de Campos
BIOSYSTEMS
2007
90views more  BIOSYSTEMS 2007»
14 years 9 months ago
Directional hearing in a silicon cricket
10 Phonotaxis is the ability to orient towards or away from sound sources. Crickets can locate conspecifics by phonotaxis to the calling (mating) song they produce, and can evade ...
Richard E. Reeve, André van Schaik, Craig T...
DLT
2009
14 years 7 months ago
Tight Bounds on the Descriptional Complexity of Regular Expressions
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
Hermann Gruber, Markus Holzer