4850 search results - page 702 / 970 » Proof and Computation in Geometry |
166
click to vote
AUIC
2004
IEEE
15 years 10 months ago
2004
IEEE
We are at present enabled with machine-empowered technologies. The future is certainly looking towards human-empowered technologies, which should enable mobile user with natural w...
174
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
164
click to vote
AAAI
2008
15 years 9 months ago
2008
The interpreted system model offers a computationally grounded model, in terms of the states of computer processes, to S5 epistemic logics. This paper extends the interpreted syst...
155
click to vote
LREC
2010
15 years 8 months ago
2010
A lot of research effort has been spent on the development of emotion theories and modeling, however, their suitability and applicability to expressions in human computer interact...
176
click to vote
STRINGOLOGY
2008
15 years 8 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...