7264 search results - page 234 / 1453 » A multiplicative up-propagation algorithm |
155
click to vote
ACL
1997
15 years 7 months ago
1997
Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[3-e) on a grammar G and a string w...
183
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We present MI-CRF, a conditional random field (CRF) model for multiple instance learning (MIL). MI-CRF models bags as nodes in a CRF with instances as their states. It combines di...
162
click to vote
JCB
2008
15 years 6 months ago
2008
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
131
click to vote
IJCSS
2007
15 years 6 months ago
2007
In this paper, learning algorithm for a single multiplicative spiking neuron (MSN) is proposed and tested for various applications where a multilayer perceptron (MLP) neural netwo...
160
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...