4536 search results - page 76 / 908 » Contention-Sensitive Data Structures and Algorithms |
SPAA
1990
ACM
14 years 1 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
We present a novel approach for filtering XML documents using nondeterministic finite automata and distributed hash tables. Our approach differs architecturally from recent propos...
SCOPES
2007
Springer
14 years 3 months ago
2007
Springer
Embedded consumer devices are increasing their capabilities and can now implement new multimedia applications reserved only for powerful desktops a few years ago. These applicatio...
IROS
2009
IEEE
14 years 3 months ago
2009
IEEE
— This paper addresses the problem of vegetation detection from laser measurements. The ability to detect vegetation is important for robots operating outdoors, since it enables ...
JSC
2002
13 years 8 months ago
2002
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of...