Sciweavers

2736 search results - page 297 / 548
» Indexing uncertain data
Sort
View
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
15 years 10 months ago
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
Stefanos Ougiaroglou, Alexandros Nanopoulos, Apost...
DAGSTUHL
2004
15 years 8 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
ECIS
2000
15 years 7 months ago
Information Filtering and Automatic Keyword Identification by Artificial Neural Networks
Information filtering (IF) systems usually filter data items by correlating a vector of terms (keywords) that represent the user profile with similar vectors of terms that represe...
Zvi Boger, Tsvi Kuflik, Bracha Shapira, Peretz Sho...

Book
2145views
17 years 4 months ago
An Introduction to Binary Search Trees and Balanced Trees
"Libavl is a library in ANSI C for manipulation of various types of binary trees. This book provides an introduction to binary tree techniques and presents all of Libavl’s ...
Ben Pfaff
DCC
2008
IEEE
16 years 6 months ago
Effective Visual Masking Techniques in JPEG2000
This paper introduces a very low complexity visual masking algorithm for the JPEG2000 image compression standard and evaluates its impact on the visual image quality by means of t...
Thomas Richter