2479 search results - page 303 / 496 » A Computational Theory of Working Memory |
181
click to vote
CSCW
2004
ACM
16 years 12 hour ago
2004
ACM
The needs of blind and visually impaired users are seriously under-investigated in CSCW. We review work on assistive interfaces especially concerning how collaboration between sig...
172
click to vote
IPSN
2004
Springer
15 years 12 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
178
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
157
click to vote
IJCAI
1989
15 years 7 months ago
1989
Several theories of grammar currently converge toward inserting subcategorization information within lexical entries. Such a tendency would benefit from a parsing algorithm able t...
211
click to vote
ML
2010
ACM
15 years 5 months ago
2010
ACM
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...