Sciweavers

8512 search results - page 249 / 1703
» Computing Theory With Relevance
Sort
View
CONCUR
2008
Springer
15 years 6 months ago
A Context-Free Process as a Pushdown Automaton
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
Jos C. M. Baeten, Pieter J. L. Cuijpers, P. J. A. ...
AAAI
1994
15 years 6 months ago
Soundness and Completeness of a Logic Programming Approach to Default Logic
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
Grigoris Antoniou, Elmar Langetepe
COGSCI
2010
160views more  COGSCI 2010»
15 years 5 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
CMG
2004
15 years 6 months ago
Quality of Service Aspects and Metrics In Grid Computing
Grid computing promises to become the future computing paradigm for enterprise application after having shown to be a quite effective computing paradigm for resource-intensive sci...
Daniel A. Menascé, Emiliano Casalicchio
DAC
2011
ACM
14 years 4 months ago
EFFEX: an embedded processor for computer vision based feature extraction
The deployment of computer vision algorithms in mobile applications is growing at a rapid pace. A primary component of the computer vision software pipeline is feature extraction,...
Jason Clemons, Andrew Jones, Robert Perricone, Sil...