182 search results - page 17 / 37 » Hidden Conditional Random Fields for Meeting Segmentation |
NIPS
2004
15 years 1 months ago
2004
Coreference analysis, also known as record linkage or identity uncertainty, is a difficult and important problem in natural language processing, databases, citation matching and m...
131
click to vote
NIPS
2004
15 years 1 months ago
2004
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...
130
click to vote
ICASSP
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...
109
click to vote
ICCV
2011
IEEE
14 years 14 days ago
2011
IEEE
Many state-of-the-art segmentation algorithms rely on Markov or Conditional Random Field models designed to enforce spatial and global consistency constraints. This is often accom...
104
Voted
AAAI
2008
15 years 2 months ago
2008
Most standard learning algorithms, such as Logistic Regression (LR) and the Support Vector Machine (SVM), are designed to deal with i.i.d. (independent and identically distributed...