Sciweavers

59 search results - page 9 / 12
» Multi-polarity text segmentation using graph theory
Sort
View
STACS
1992
Springer
13 years 11 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
MM
2006
ACM
148views Multimedia» more  MM 2006»
14 years 1 months ago
Audio similarity measure by graph modeling and matching
This paper proposes a new approach for the similarity measure and ranking of audio clips by graph modeling and matching. Instead of using frame-based or salient-based features to ...
Yuxin Peng, Chong-Wah Ngo, Cuihua Fang, Xiaoou Che...
ICFCA
2004
Springer
14 years 28 days ago
Automated Lattice Drawing
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
Ralph Freese
PAMI
2010
174views more  PAMI 2010»
13 years 6 months ago
Image Segmentation with a Unified Graphical Model
—We propose a unified graphical model that can represent both the causal and noncausal relationships among random variables and apply it to the image segmentation problem. Specif...
Lei Zhang 0011, Qiang Ji

Book
5396views
15 years 6 months ago
Markov Random Field Modeling in Computer Vision
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
Stan Z. Li