Sciweavers

853 search results - page 109 / 171
» Similarity Indexing with the SS-tree
Sort
View
NIPS
2008
14 years 11 months ago
Stochastic Relational Models for Large-scale Dyadic Data using MCMC
Stochastic relational models (SRMs) [15] provide a rich family of choices for learning and predicting dyadic data between two sets of entities. The models generalize matrix factor...
Shenghuo Zhu, Kai Yu, Yihong Gong
DAGSTUHL
2004
14 years 11 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...
KDID
2004
481views Database» more  KDID 2004»
14 years 11 months ago
Models and Indices for Integrating Unstructured Data with a Relational Database
Abstract. Database systems are islands of structure in a sea of unstructured data sources. Several real-world applications now need to create bridges for smooth integration of semi...
Sunita Sarawagi
ECIS
2000
14 years 11 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...
SPIESR
1996
122views Database» more  SPIESR 1996»
14 years 11 months ago
Retrieval by Content in Symbolic-Image Databases
Two approaches for integrating images into the framework of a database management system are presented. The classi cation approach preprocesses all images and attaches a semantic ...
Aya Soffer, Hanan Samet