11231 search results - page 125 / 2247 » Digging for Data Structures |
101
Voted
ICCV
2001
IEEE
16 years 4 months ago
2001
IEEE
119
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
109
Voted
CADE
2005
Springer
16 years 3 months ago
2005
Springer
164
Voted
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
105
Voted
SODA
2010
ACM
16 years 3 days ago
2010
ACM
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...