Amanote Research

Amanote Research

    RegisterSign In

Space-Efficient Framework for Top-K String Retrieval Problems

doi 10.1109/focs.2009.19
Full Text
Open PDF
Abstract

Available in full text

Date

October 1, 2009

Authors
Wing-Kai HonRahul ShahJeffrey Scott Vitter
Publisher

IEEE


Related search

Space-Efficient Top-K Document Retrieval

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Efficient Processing of Top-K Spatial Keyword Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Efficient Processing of Top-K Spatial Preference Queries

Proceedings of the VLDB Endowment
Computer Science
2010English

An Efficient Approach for Mining Top-K Fault-Tolerant Repeating Patterns

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Efficient Search for the Top-K Probable Nearest Neighbors in Uncertain Databases

Proceedings of the VLDB Endowment
Computer Science
2008English

Efficient and Self-Tuning Incremental Query Expansion for Top-K Query Processing

2005English

Top-KColor Queries for Document Retrieval

2011English

Efficient Multi-Structure Robust Fitting With Incremental Top-K Lists Comparison

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Efficient Algorithms for String-Based Negative Selection

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy