Using local optimality criteria for efficient information retrieval with redundant information filters - Info and Reading Options
By Neil C. Rowe

"Using local optimality criteria for efficient information retrieval with redundant information filters" was published by Naval Postgraduate School in 1994 - Monterey, Calif, it has 35 pages and the language of the book is English.
“Using local optimality criteria for efficient information retrieval with redundant information filters” Metadata:
- Title: ➤ Using local optimality criteria for efficient information retrieval with redundant information filters
- Author: Neil C. Rowe
- Language: English
- Number of Pages: 35
- Publisher: Naval Postgraduate School
- Publish Date: 1994
- Publish Location: Monterey, Calif
“Using local optimality criteria for efficient information retrieval with redundant information filters” Subjects and Themes:
- Subjects: INFORMATION RETRIEVAL - OPTIMIZATION - FILTER ANALYSIS - INFORMATION THEORY - MATHEMATICAL FILTERS
Edition Specifications:
- Pagination: 35, [9] p.
Edition Identifiers:
- The Open Library ID: OL33223385M - OL24993240W
AI-generated Review of “Using local optimality criteria for efficient information retrieval with redundant information filters”:
"Using local optimality criteria for efficient information retrieval with redundant information filters" Description:
The Open Library:
We consider information retrieval when the data, for instance multimedia, is computationally expensive to fetch. Our approach uses information filters to considerably narrow the universe of possibilities before retrieval. Then decisions must be made about the necessity, order, and concurrent processing of proposed filters (an execution plan ). We develop simple polynomial-time local criteria for optimal execution plans, and show that most forms of concurrency are suboptimal with information filters. Although the general problem of finding an optimal execution plan is likely exponential in the numbers of filters, we show experimentally that our local optimality criteria, used in a polynomial-time algorithm, nearly always find the global optimum with 15 filters or less, sufficient number of filters for most applications. Our methods do not require special hardware and avoid the high processor idleness that is characteristic of massive-parallelism solutions to this problem. We apply our ideas to an important application, information retrieval of captioned data using natural-language understanding, a problem for which the natural-language processing can be the bottleneck if not implemented well. Filters, Optimization, Queries, Conjunction, Boolean algebra, Natural lan guage.
Read “Using local optimality criteria for efficient information retrieval with redundant information filters”:
Read “Using local optimality criteria for efficient information retrieval with redundant information filters” by choosing from the options below.
Search for “Using local optimality criteria for efficient information retrieval with redundant information filters” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "Using local optimality criteria for efficient information retrieval with redundant information filters" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: full
- Check if available: The Open Library & The Internet Archive
Find “Using local optimality criteria for efficient information retrieval with redundant information filters” in Libraries Near You:
Read or borrow “Using local optimality criteria for efficient information retrieval with redundant information filters” from your local library.
Buy “Using local optimality criteria for efficient information retrieval with redundant information filters” online:
Shop for “Using local optimality criteria for efficient information retrieval with redundant information filters” on popular online marketplaces.
- Ebay: New and used books.