2555 search results - page 271 / 511 » Quantifiers and Working Memory |
130
click to vote
CCR
2008
15 years 4 months ago
2008
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
132
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We address the problem of autonomously learning controllers for visioncapable mobile robots. We extend McCallum's (1995) Nearest-Sequence Memory algorithm to allow for genera...
161
click to vote
DKE
2006
15 years 4 months ago
2006
Previous work in change detection to XML documents is not suitable for detecting the changes to large XML documents as it requires a lot of memory to keep the two versions of XML ...
133
click to vote
ENTCS
2007
15 years 4 months ago
2007
We present an implementation of Rijndael for wireless sensor networks running on Eyes sensor nodes. In previous works, Rijndael has not been considered a suitable encryption algor...
139
click to vote
CAD
2000
Springer
15 years 4 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...