One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
Complex Network of Earthquakes Sumiyoshi Abe Institute of Physics, University of Tsukuba Ibaraki 3058571, Japan First, a brief discussion is made about a relevance of nonextensive...
Abstract. New emerging applications including genomic, multimedia, and geospatial technologies have necessitated the handling of complex application objects that are highly structu...
Tao Chen, Arif Khan, Markus Schneider, Ganesh Visw...
A novel particle filter, the Memory-based Particle Filter
(M-PF), is proposed that can visually track moving objects
that have complex dynamics. We aim to realize robustness
aga...
Dan Mikami (NTT), Kazuhiro Otsuka (NTT), Junji YAM...