Sciweavers

921 search results - page 58 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
140
Voted
DATE
2000
IEEE
134views Hardware» more  DATE 2000»
15 years 8 months ago
An on Chip ADC Test Structure
In this paper, a new built-in self-test structure to test the static specifications of analog to digital converters (ADCs) is presented. A ramp signal generated by an integrator ...
Yun-Che Wen, Kuen-Jong Lee
VTC
2008
IEEE
110views Communications» more  VTC 2008»
15 years 10 months ago
FFT Sign Search with Secondary Code Constraints for GNSS Signal Acquisition
— New GNSS signals are usually characterized by the presence of secondary codes and high data rates that can make the sign of the transmitted signal change each primary code peri...
Daniele Borio
PKDD
2007
Springer
132views Data Mining» more  PKDD 2007»
15 years 10 months ago
An Algorithm to Find Overlapping Community Structure in Networks
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
Steve Gregory
CIKM
2008
Springer
15 years 6 months ago
Dynamic faceted search for discovery-driven analysis
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
Debabrata Dash, Jun Rao, Nimrod Megiddo, Anastasia...
CORR
2010
Springer
120views Education» more  CORR 2010»
14 years 11 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
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...
Jérémy Barbay, Johannes Fischer