2557 search results - page 11 / 512 » Real scaled matching |
ICDE
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
AICCSA
2006
IEEE
14 years 3 months ago
2006
IEEE
Today most multiplayer game servers are pre-located statically, which makes it hard for gamers to find equi-ping hosts for their matches. This is especially important for first per...
IRAL
2003
ACM
14 years 3 months ago
2003
ACM
Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usuall...
SIGMETRICS
2010
ACM
13 years 8 months ago
2010
ACM
Many network-management problems in large backbone networks need the answer to a seemingly simple question: where does a given IP packet, entering the network at a particular plac...
ICASSP
2011
IEEE
2011
IEEE
Efficient search of music pitch contours using wavelet transforms and segmented dynamic time warping
13 years 1 months ago
We propose a method of music melody matching based on their “continuous” (or “time-frame-based”) pitch contours. Most previous methods using frame-based contours either ma...