185 search results - page 33 / 37 » Some extensions of score matching |
ECCC
2008
13 years 8 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
KDD
2012
ACM
11 years 11 months 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...
BMCBI
2008
13 years 8 months ago
2008
Background: Correctly merged data sets that have been independently genotyped can increase statistical power in linkage and association studies. However, alleles from microsatelli...
JISE
2007
13 years 8 months ago
2007
Query expansion is extensively applied in information retrieval systems, such as search engines. Most conventional approaches to query expansion have been developed based on textua...
IANDC
2011
13 years 3 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...