We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
Edda Happ, Daniel Johannsen, Christian Klein, Fran...
Abstract—We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (...
We explore the problem of assigning heterogeneous tasks to workers with different, unknown skill sets in crowdsourcing markets such as Amazon Mechanical Turk. We first formalize ...
We propose a method for estimating the credibility of the posted information from users. The system displays these information on the map. Since posted information can include sub...
Koji Yamamoto, Daisuke Katagami, Katsumi Nitta, Ak...