328 search results - page 43 / 66 » Deterministic k-set structure |
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Persons may perform an activity in many different styles, or noise may cause an identical activity to have different temporal structures. We present a robust methodology for recog...
MOBIQUITOUS
2007
IEEE
15 years 4 months ago
2007
IEEE
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...
ECAI
1994
Springer
15 years 1 months ago
1994
Springer
Abstract. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue...