Sciweavers

329 search results - page 8 / 66
» Fast structural similarity index algorithm
Sort
View
ICDE
1992
IEEE
116views Database» more  ICDE 1992»
13 years 11 months ago
An Index Implementation Supporting Fast Recovery for the POSTGRES Storage System
This paper presents two algorithms for maintaining Btree index consistency in a DBMS which does not use write-ahead logging (WAL). One algorithm is similar to shadow paging, but i...
Mark Sullivan, Michael A. Olson
DATAMINE
1999
113views more  DATAMINE 1999»
13 years 7 months ago
A Fast Parallel Clustering Algorithm for Large Spatial Databases
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
Xiaowei Xu, Jochen Jäger, Hans-Peter Kriegel
VLDB
2001
ACM
92views Database» more  VLDB 2001»
13 years 12 months ago
Fast Evaluation Techniques for Complex Similarity Queries
Complex similarity queries, i.e., multi-feature multi-object queries, are needed to express the information need of a user against a large multimedia repository. Even if a user in...
Klemens Böhm, Michael Mlivoncic, Hans-Jö...
BMCBI
2010
139views more  BMCBI 2010»
13 years 7 months ago
CMASA: an accurate algorithm for detecting local protein structural similarity and its application to enzyme catalytic site anno
Background: The rapid development of structural genomics has resulted in many "unknown function" proteins being deposited in Protein Data Bank (PDB), thus, the functiona...
Gong-Hua Li, Jing-Fei Huang
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 10 months 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...