Sciweavers

7065 search results - page 1066 / 1413
» Iterative Scheduling Algorithms
Sort
View
COMPGEOM
2004
ACM
16 years 5 days ago
Approximate convex decomposition of polygons
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
Jyh-Ming Lien, Nancy M. Amato
ISMIR
2004
Springer
138views Music» more  ISMIR 2004»
16 years 3 days ago
MusicBLAST - Gapped Sequence Alignment for MIR
We propose an algorithm, MusicBLAST, for approximate pattern search/matching on symbolic musical data. MusicBLAST is based on the BLAST algorithm, one of the most commonly used al...
Jürgen Kilian, Holger H. Hoos
ISMIR
2004
Springer
118views Music» more  ISMIR 2004»
16 years 3 days ago
Learning to Align Polyphonic Music
We describe an efficient learning algorithm for aligning a symbolic representation of a musical piece with its acoustic counterpart. Our method employs a supervised learning appr...
Shai Shalev-Shwartz, Joseph Keshet, Yoram Singer
PCM
2004
Springer
125views Multimedia» more  PCM 2004»
16 years 2 days ago
Semantic Analysis of Basketball Video Using Motion Information
Abstract. This paper presents a new method for extracting semantic information from basketball video. Our approach consists of three stages: shot and scene boundary detection, scen...
Song Liu, Haoran Yi, Liang-Tien Chia, Deepu Rajan,...
ECCV
2010
Springer
16 years 1 days ago
Reweighted Random Walks for Graph Matching
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
Minsu Cho (Seoul National University), Jungmin Lee...
« Prev « First page 1066 / 1413 Last » Next »