1477 search results - page 135 / 296 » Pattern Matching with Swaps |
174
click to vote
CPM
1998
Springer
15 years 6 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
117
click to vote
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
113
Voted
TCSV
2010
14 years 9 months ago
2010
Motion compensated prediction plays a vital role in achieving enormous video compression efficiency in advanced video coding standards. Most practical motion compensated prediction...
139
click to vote
INFOCOM
1999
IEEE
15 years 7 months ago
1999
IEEE
-- The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure, and a need to introduce guaranteed qualities of service (QoS)....
135
Voted
KDD
2000
ACM
15 years 6 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...