269 search results - page 5 / 54 » Indexing text data under space constraints |
CPM
2010
Springer
15 years 4 months ago
2010
Springer
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
104
click to vote
CATA
2004
15 years 1 months ago
2004
Many languages are in serious danger of being lost and as a result, there has been a significant increase in language documentation projects, and also in attempts to preserve lang...
103
click to vote
WADS
2009
Springer
15 years 6 months ago
2009
Springer
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
107
click to vote
DATE
2010
IEEE
15 years 4 months ago
2010
IEEE
— In this paper we present a cross-domain application for ambient and health monitoring. The system architecture is intended to be openly extensible in order to fulfil unanticipa...