4302 search results - page 402 / 861 » Index Pairs Algorithms |
126
Voted
MM
2010
ACM
15 years 6 months ago
2010
ACM
Many content-based retrieval systems (CBIRS) describe images using the SIFT local features because of their very robust recognition capabilities. While SIFT features proved to cop...
129
click to vote
DAM
2010
15 years 6 months ago
2010
Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2...
161
click to vote
IR
2008
15 years 6 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
147
click to vote
JDA
2008
15 years 6 months ago
2008
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
140
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
Text reuse occurs in many different types of documents and for many different reasons. One form of reuse, duplicate or near-duplicate documents, has been a focus of researchers be...