6906 search results - page 202 / 1382 » An algorithm for modelling key terms |
175
Voted
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
138
click to vote
ECIR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. The Multiple Bernoulli (MB) Language Model has been generally considered too computationally expensive for practical purposes and superseded by the more efficient multino...
149
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
151
click to vote
AAAI
2004
15 years 7 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
174
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...