7264 search results - page 116 / 1453 » A multiplicative up-propagation algorithm |
141
click to vote
UAI
2008
15 years 5 months ago
2008
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabi...
137
click to vote
DCC
1998
IEEE
15 years 8 months ago
1998
IEEE
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
116
Voted
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
We describe an algorithm for learning in the presence of multiple criteria. Our technique generalizes previous approaches in that it can learn optimal policies for all linear pref...
133
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
120
click to vote
GD
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...