419 search results - page 12 / 84 » Succincter |
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
SIGIR
2006
ACM
15 years 3 months ago
2006
ACM
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
FCT
2005
Springer
15 years 3 months ago
2005
Springer
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real co...
WADS
2005
Springer
15 years 2 months ago
2005
Springer
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.