223 search results - page 21 / 45 » Generalized Descriptor Compression for Storage and Matching |
SAC
2008
ACM
14 years 9 months ago
2008
ACM
When developing semantic applications, the construction of ontologies is a crucial part. We are developing a semiautomatic ontology construction approach, OntoCase, relying on ont...
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
Traditional interactive information retrieval systems function by creating inverted lists, or term indexes. For every term in the vocabulary, a list is created that contains the d...
106
click to vote
KDD
2012
ACM
13 years 3 days ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
118
click to vote
RECOMB
2004
Springer
15 years 10 months ago
2004
Springer
In situ staining of a target mRNA at several time points during the development of a D. melanogaster embryo gives one a detailed spatio-temporal view of the expression pattern of ...
CONEXT
2007
ACM
15 years 1 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...