868 search results - page 39 / 174 » A general compression algorithm that supports fast searching |
RECOMB
2009
Springer
14 years 8 months ago
2009
Springer
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of tw...
SPIRE
2005
Springer
14 years 1 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modificatio...
INFOSCALE
2007
ACM
13 years 9 months ago
2007
ACM
Searching for non-text data (e.g., images) is mostly done by means of metadata annotations or by extracting the text close to the data. However, supporting real content-based audi...
ICIP
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper, we present a new framework to compress the geometry of images. This framework generalizes the standard quad partitioning approaches in compression of image geometry ...