2223 search results - page 134 / 445 » Ontological Framework for Approximation |
145
click to vote
EMNLP
2011
14 years 4 months ago
2011
We exploit sketch techniques, especially the Count-Min sketch, a memory, and time efficient framework which approximates the frequency of a word pair in the corpus without explic...
142
click to vote
CVPR
1998
IEEE
16 years 7 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
159
Voted
ICML
2005
IEEE
16 years 6 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
158
click to vote
SARA
2009
Springer
15 years 11 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
142
click to vote
WSC
2008
15 years 7 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...