Editorial responsibilities arising from personalization algorithms
نویسندگان
چکیده
منابع مشابه
Variance reduction of estimators arising from Metropolis-Hastings algorithms
The Metropolis–Hastings algorithm is one of the most basic and well-studied Markov chain Monte Carlo methods. It generates a Markov chain which has as limit distribution the target distribution by simulating observations from a different proposal distribution. A proposed value is accepted with some particular probability otherwise the previous value is repeated. As a consequence, the accepted v...
متن کاملApproximation Algorithms for Data Association Problem Arising from Multitarget Tracking
In this paper, we discuss a data association problem arising from multitarget tracking. We formulate the problem as a multi-dimensional assignment problem and propose a polynomial time 1.8-approximation algorithm for simple case. We also propose a 3.7approximation algorithm for general cases.
متن کاملEditorial Bioinformatics Algorithms and Genomics
The Human Genome Project was completed in April 2003 [1]. All of the 3.2 billion base pairs in the entire human genome have been sequenced in this project. The Human Genome Project is a revolutionizing biological and medical research [2]. However, it was just the starting point for us to understand the function of our genome. Extraordinary amount of information generated from the Human Genome P...
متن کاملOn generalized topologies arising from mappings
Given a mapping $f:Xto X$ we naturally associate to it a monotonic map $gg_f:exp Xto exp X$ from the power set of $X$ into itself, thus inducing a generalized topology on $X$. In this paper we investigate some properties of generalized topologies which are defined by such a procedure.
متن کاملEecient Approximation Algorithms for Semideenite Programs Arising from Max Cut and Coloring Eecient Approximation Algorithms for Semideenite Programs Arising from Max Cut and Coloring
The best known approximation algorithm for graph MAX CUT, due to Goemans and Williamson, rst nds the optimal solution a semideenite program and then derives a graph cut from that solution. Building on this result, Karger, Motwani, and Sudan gave an approximation algorithm for graph coloring that also involves solving a semideenite program. Solving these semideenite programs using known methods ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The ORBIT Journal
سال: 2017
ISSN: 2515-8562
DOI: 10.29297/orbit.v1i1.26