1675 search results - page 15 / 335 » Implementing Data Cubes Efficiently |
STOC
1998
ACM
14 years 2 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
VLDB
1999
ACM
14 years 2 months ago
1999
ACM
Many efficient algorithms to compute multidimensional aggregation and Cube for relational OLAP have been developed. However, to our knowledge, there is nothing to date in the lite...
WAE
2001
13 years 11 months ago
2001
Abstract. A new realization of a space-efficient deque is presented. The data structure is constructed from three singly resizable arrays, each of which is a blockwiseallocated pil...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
Marked point processes have received a great attention in the recent years, for their ability to extract objects in large data sets as those obtained in biological studies or hype...
ERSA
2006
13 years 11 months ago
2006
- In this paper, we present a prototype FPGA design for an efficient physical layer implementation of a MIMO-OFDM technique. We propose a pipelined architecture using a Fast Fourie...