Sciweavers

921 search results - page 147 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
NAR
1998
101views more  NAR 1998»
15 years 3 months ago
The PRINTS protein fingerprint database in its fifth year
PRINTS is a database of protein family ‘fingerprints’ offering a diagnostic resource for newly-determined sequences. By contrast with PROSITE, which uses single consensus expr...
Terri K. Attwood, Michael E. Beck, Darren R. Flowe...
MMS
2008
15 years 3 months ago
Semantic interactive image retrieval combining visual and conceptual content description
We address the challenge of semantic gap reduction for image retrieval through an improved SVM-based active relevance feedback framework, together with a hybrid visual and concept...
Marin Ferecatu, Nozha Boujemaa, Michel Crucianu
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
16 years 4 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
15 years 10 months ago
Efficient Clustering for Orders
Lists of ordered objects are widely used as representational forms. Such ordered objects include Web search results or best-seller lists. Clustering is a useful data analysis tech...
Toshihiro Kamishima, Shotaro Akaho
157
Voted
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
15 years 5 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...