4850 search results - page 665 / 970 » Approximate Data Structures with Applications |
139
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
A dense antenna array architecture is developed to ease the circuit requirements of the radio frequency (RF) front-end in beamforming applications. In the architecture, antennas a...
179
click to vote
JDA
2006
15 years 6 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
144
Voted
VLSISP
2002
15 years 6 months ago
2002
This paper addresses a method of blind source separation that jointly exploits the nonstationarity and temporal structure of sources. The method needs only multiple time-delayed co...
159
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
185
click to vote
TODS
2012
13 years 8 months ago
2012
B-trees have been ubiquitous in database management systems for several decades, and they serve in many other storage systems as well. Their basic structure and their basic operat...