On implementing an algorithm for the convex cost network flow problem

Download

028901.pdf

Date

1993

Author

Tüfekçi, Tolga

Metadata

Show full item record

Item Usage Stats

40
views

0
downloads

URI

https://hdl.handle.net/11511/9938

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

On integrating a language model into neural machine translation Gulcehre, Caglar; Firat, Orhan; Xu, Kelvin; Cho, Kyunghyun; Bengio, Yoshua (Elsevier BV, 2017-09-01) Recent advances in end-to-end neural machine translation models have achieved promising results on high-resource language pairs such as En -> Fr and En -> De. One of the major factor behind these successes is the availability of high quality parallel corpora. We explore two strategies on leveraging abundant amount of monolingual data for neural machine translation. We observe improvements by both combining scores from neural language model trained only on target monolingual data with neural machine translat...
On Equivalence Relationships Between Classification and Ranking Algorithms Ertekin Bolelli, Şeyda (2011-10-01) We demonstrate that there are machine learning algorithms that can achieve success for two separate tasks simultaneously, namely the tasks of classification and bipartite ranking. This means that advantages gained from solving one task can be carried over to the other task, such as the ability to obtain conditional density estimates, and an order-of-magnitude reduction in computational time for training the algorithm. It also means that some algorithms are robust to the choice of evaluation metric used; the...
ON PARAMETRIC LOWER BOUNDS FOR DISCRETE-TIME FILTERING Fritsche, Carsten; Orguner, Umut; Gustafsson, Fredrik (2016-03-25) Parametric Cramer-Rao lower bounds (CRLBs) are given for discrete-time systems with non-zero process noise. Recursive expressions for the conditional bias and mean-square-error (MSE) (given a specific state sequence) are obtained for Kalman filter estimating the states of a linear Gaussian system. It is discussed that Kalman filter is conditionally biased with a non-zero process noise realization in the given state sequence. Recursive parametric CRLBs are obtained for biased estimators for linear state esti...
On numerical optimization theory of infinite kernel learning Ozogur-Akyuz, S.; Weber, Gerhard Wilhelm (2010-10-01) In Machine Learning algorithms, one of the crucial issues is the representation of the data. As the given data source become heterogeneous and the data are large-scale, multiple kernel methods help to classify "nonlinear data". Nevertheless, the finite combinations of kernels are limited up to a finite choice. In order to overcome this discrepancy, a novel method of "infinite" kernel combinations is proposed with the help of infinite and semi-infinite programming regarding all elements in kernel space. Look...
On decoding interleaved reed-solomon codes Yayla, Oğuz; Özbudak, Ferruh; Department of Cryptography (2011) Probabilistic simultaneous polynomial reconstruction algorithm of Bleichenbacher-Kiayias-Yung is extended to the polynomials whose degrees are allowed to be distinct. Furthermore, it is observed that probability of the algorithm can be increased. Specifically, for a finite field $\F$, we present a probabilistic algorithm which can recover polynomials $p_1,\ldots, p_r \in \F[x]$ of degree less than $k_1,k_2,\ldots,k_r$, respectively with given field evaluations $p_l(z_i) = y_{i,l}$ for all $i \in I$, $

Citation Formats

T. Tüfekçi, “On implementing an algorithm for the convex cost network flow problem,” Middle East Technical University, 1993.