1192 search results - page 121 / 239 » Computing Weakest Readings |
116
Voted
EUPROJECTS
2006
Springer
15 years 7 months ago
2006
Springer
This paper examines problems persons with deafblindness have when using computers and it analyses how we can approach these problems in the redesign of a communication tool. A qual...
108
Voted
DIALM
2000
ACM
15 years 7 months ago
2000
ACM
This paper presents an efficient collision resolution protocol and its variations for the tag identification problem, where an electromagnetic reader attempts to obtain within its...
114
click to vote
WDAG
1995
Springer
15 years 7 months ago
1995
Springer
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
131
Voted
FLAIRS
2007
15 years 6 months ago
2007
Recent research in reading comprehension supports the hypothesis that readers are aided by textual cohesion. Traditional readability formulas are not able to effectively assess le...
103
click to vote
AAAI
2010
15 years 5 months ago
2010
We consider here the problem of building a never-ending language learner; that is, an intelligent computer agent that runs forever and that each day must (1) extract, or read, inf...