Sciweavers

7839 search results - page 19 / 1568
» What's there and what's not
Sort
View
ENTCS
2002
78views more  ENTCS 2002»
13 years 8 months ago
What can we do with a Solution?
If S = 0 is a system of n equations and unknowns over C and S() = 0 to what extent can we compute with the point ? In particular, can we decide whether or not a polynomial express...
Simon Langley, Daniel Richardson
ICGI
2010
Springer
13 years 7 months ago
Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
Sophia Katrenko, Menno van Zaanen
ISEUD
2009
Springer
14 years 3 months ago
What Is End-User Software Engineering and Why Does It Matter?
End-user programming has become ubiquitous, so much so that there are more end-user programmers today than there are professional programmers. End-user programming empowers—but t...
Margaret M. Burnett
CBMS
2008
IEEE
14 years 3 months ago
What Do You Want to Know? Investigating the Information Requirements of Patient Supporters
There is a vast amount of data associated with any one patient. It is challenging for medical staff to understand all this data. It is even harder for a lay person, who may not ev...
Wendy Moncur, Judith Masthoff, Ehud Reiter
TARK
2007
Springer
14 years 2 months ago
What can we achieve by arbitrary announcements?: A dynamic take on Fitch's knowability
Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of age...
Philippe Balbiani, Alexandru Baltag, Hans P. van D...