Sciweavers

1283 search results - page 220 / 257
» Probabilistic structured query methods
Sort
View
VLDB
1999
ACM
131views Database» more  VLDB 1999»
14 years 1 months ago
High-Performance Extensible Indexing
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
Marcel Kornacker
JODL
2000
76views more  JODL 2000»
13 years 9 months ago
Strategy-based interactive cluster visualization for information retrieval
Abstract. In this paper we investigate a general purpose interactive information organization system. The system organizes documents by placing them into 1-, 2-, or 3-dimensional s...
Anton Leuski, James Allan
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
11 years 11 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
BMCBI
2005
119views more  BMCBI 2005»
13 years 9 months ago
The distance-profile representation and its application to detection of distantly related protein families
Background: Detecting homology between remotely related protein families is an important problem in computational biology since the biological properties of uncharacterized protei...
Chin-Jen Ku, Golan Yona
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
13 years 3 days ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...