2489 search results - page 69 / 498 » On the Subgroup Distance Problem |
129
Voted
CAIP
2009
Springer
15 years 8 months ago
2009
Springer
Edit distance matching has been used in literature for word spotting with characters taken as primitives. The recognition rate however, is limited by the segmentation inconsistenci...
128
click to vote
VLDB
1990
ACM
15 years 7 months ago
1990
ACM
In applications such as vision and molecular biology, a common problem is to find the similar objects to a given target (according to some distance measure) in a large database. T...
238
Voted
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
129
Voted
ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
16 years 20 days ago
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
128
Voted
GCB
2007
Springer
15 years 10 months ago
2007
Springer
The most parsimonous distances calculated in pairwise gene order comparisons cannot accurately reflect the true number of events separating two species, unless the number of chan...