522 search results - page 73 / 105 » Query segmentation using conditional random fields |
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
105
click to vote
WIDM
2004
ACM
15 years 3 months ago
2004
ACM
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
We present a variational Bayesian framework for performing inference, density estimation and model selection in a special class of graphical models--Hidden Markov Random Fields (H...
ACCV
2010
Springer
14 years 4 months ago
2010
Springer
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
88
Voted
ICIP
1998
IEEE
15 years 11 months ago
1998
IEEE
An algorithm for speaker's lip segmentation and features extraction is presented in this paper. A color video sequence of speaker's face is acquired, under natural light...