4112 search results - page 341 / 823 » Efficient Algorithms for the Spoonerism Problem |
258
Voted
SIAMMAX
2010
15 years 1 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
161
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we propose an approximated structured prediction framework for large scale graphical models and derive message-passing algorithms for learning their parameters effic...
211
click to vote
ICCBR
2009
Springer
15 years 4 months ago
2009
Springer
Previous approaches to case-based planning often finds a similar plan case to a new planning problem to adapt to solve the new problem. However, in the case base, there may be some...
179
click to vote
APPINF
2003
15 years 8 months ago
2003
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
162
Voted
COLT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper we unify divergence minimization and statistical inference by means of convex duality. In the process of doing so, we prove that the dual of approximate max...