1508 search results - page 208 / 302 » Efficient Path Profiling |
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper, we introduce a new approach for modeling
visual context. For this purpose, we consider the leaves of a
hierarchical segmentation tree as elementary units. Each
le...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
Dynamic Time Warping (DTW) has been widely used to align and compare two sequences. DTW can efficiently deal with local warp or deformation between sequences. However, it can'...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
ICML
2003
IEEE
14 years 9 months ago
2003
IEEE
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
SIGMOD
2004
ACM
14 years 9 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...