Sciweavers

22 search results - page 3 / 5
» Index compression is good, especially for random access
Sort
View
MVA
2000
203views Computer Vision» more  MVA 2000»
13 years 8 months ago
An Environment to Test Progressive Refinement of Indexing for Content-Based Image Retrieval
Content-based image retrieval is a fairly new discipline. Yet research in this field has highlighted many approaches that show good performance in specific subproblems using singl...
Maria Grazia Albanesi, Marco Ferretti, Alessandro ...
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
13 years 11 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 2 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Cem Tekin, Mingyan Liu
DKE
2006
67views more  DKE 2006»
13 years 7 months ago
Indexed-based density biased sampling for clustering applications
Density biased sampling (DBS) has been proposed to address the limitations of Uniform sampling, by producing the desired probability distribution in the sample. The ease of produc...
Alexandros Nanopoulos, Yannis Theodoridis, Yannis ...
CASES
2006
ACM
14 years 1 months ago
Automated compile-time and run-time techniques to increase usable memory in MMU-less embedded systems
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
Lan S. Bai, Lei Yang, Robert P. Dick