Sciweavers

3270 search results - page 70 / 654
» Approximate String Processing
Sort
View
FSTTCS
2003
Springer
14 years 28 days ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...
JMLR
2010
111views more  JMLR 2010»
13 years 2 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
EACL
1993
ACL Anthology
13 years 9 months ago
Using an Annotated Corpus as a Stochastic Grammar
In Data Oriented Parsing (DOP), an annotated corpus is used as a stochastic grammar. An input string is parsed by combining subtrees from the corpus. As a consequence, one parse t...
Rens Bod
ICANN
2011
Springer
12 years 11 months ago
Learning Curves for Gaussian Processes via Numerical Cubature Integration
This paper is concerned with estimation of learning curves for Gaussian process regression with multidimensional numerical integration. We propose an approach where the recursion e...
Simo Särkkä
EACL
1989
ACL Anthology
13 years 9 months ago
Parsing And Derivational Equivalence
It is a tacit assumption of much linguisticinquiry that alldistinctderivations of a string should assign distinct meanings. But despite the tidinessof such derivational uniqueness...
Mark Hepple, Glyn Morrill