1421 search results - page 81 / 285 » Algorithms for subsequence combinatorics |
138
click to vote
ECML
2006
Springer
15 years 6 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
115
click to vote
LREC
2008
15 years 5 months ago
2008
This paper presents a series of tools for the extraction of specialized corpora from the web and its subsequent analysis mainly with statistical techniques. It is an integrated sy...
131
click to vote
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
Typically, sequence signatures, such as motifs and domains, are assumed to be localized in one region of a sequence or are derived as combinations of the former. We generalize the...
136
click to vote
EMNLP
2009
15 years 1 months ago
2009
We present a method for detecting and correcting multiple real-word spelling errors using the Google Web 1T 3-gram data set and a normalized and modified version of the Longest Co...
158
click to vote
JMLR
2012
13 years 6 months ago
2012
Many real-world problems are inherently hierarchically structured. The use of this structure in an agent’s policy may well be the key to improved scalability and higher performa...