Sciweavers

874 search results - page 48 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
ISMIR
2004
Springer
157views Music» more  ISMIR 2004»
15 years 3 months ago
Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a...
Anna Lubiw, Luke Tanur
PAM
2004
Springer
15 years 3 months ago
Geometric Exploration of the Landmark Selection Problem
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
Liying Tang, Mark Crovella
DCC
1998
IEEE
15 years 2 months ago
Multiple Pattern Matching in LZW Compressed Text
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Mas...
CORR
2010
Springer
96views Education» more  CORR 2010»
14 years 10 months ago
Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
JMLR
2006
89views more  JMLR 2006»
14 years 9 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel