1489 search results - page 249 / 298 » Optimizing Feature Sets for Structured Data |
ENGL
2007
13 years 8 months ago
2007
— We make use of discrete wavelets to extract distinguishing features between normal and cancerous human breast tissue fluorescence spectra. These are then used in conjunction wi...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
TSP
2011
13 years 3 months ago
2011
—This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications system...
INFOCOM
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
DEXA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...