Sciweavers

6274 search results - page 189 / 1255
» From query complexity to computational complexity
Sort
View
ICDE
2009
IEEE
180views Database» more  ICDE 2009»
16 years 6 months ago
Reverse Furthest Neighbors in Spatial Databases
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...
Bin Yao, Feifei Li, Piyush Kumar
BMCBI
2010
105views more  BMCBI 2010»
15 years 4 months ago
A knowledge-guided strategy for improving the accuracy of scoring functions in binding affinity prediction
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
Tiejun Cheng, Zhihai Liu, Renxiao Wang
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
15 years 4 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
ICPR
2008
IEEE
16 years 5 months ago
Unfolding warping for object recognition
In practice, understanding the spatial relationships between the surfaces of an object, can significantly improve the performance of object recognition systems. In this paper we p...
Jun Xie, Min Hu, Mubarak Shah
DIS
2001
Springer
15 years 9 months ago
Dynamic Aggregation to Support Pattern Discovery: A Case Study with Web Logs
Rapid growth of digital data collections is overwhelming the capabilities of humans to comprehend them without aid. The extraction of useful data from large raw data sets is someth...
Lida Tang, Ben Shneiderman