7661 search results - page 214 / 1533 » Languages and the Computing Profession |
157
click to vote
AMAST
2006
Springer
15 years 10 months ago
2006
Springer
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
170
click to vote
IAT
2007
IEEE
16 years 26 days ago
2007
IEEE
Arabic Language understanding (ALU) computing is considered an AI-hard task. In this paper, we propose an Agent model for ALU problem. This agent is detailed in this paper. An ALU...
179
click to vote
ICTCS
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Non-interference is a desirable property of systems in a multilevel security architecture, stating that confidential information is not disclosed in public output. The c...
164
click to vote
NORDICHI
2004
ACM
15 years 12 months ago
2004
ACM
This paper presents the results of a software usability study, involving both subjective and objective evaluation. It compares a popular XML data transformation language (XSLT) an...
157
click to vote
FOSSACS
2004
Springer
15 years 12 months ago
2004
Springer
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...