String pattern matching is a computationally expensive task, and when implemented in hardware, it can consume a large amount of resources for processing and storage. This paper pr...
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...
In this paper we propose a surface reconstruction method for highly noisy and non-uniform data based on minimal surface model and tensor voting method. To deal with ill-posedness, ...
DanFeng Lu, HongKai Zhao, Ming Jiang 0001, ShuLin ...
Adaptation is an essential requirement for self–organizing multi–agent systems functioning in unknown dynamic environments. Adaptation allows agents, e.g., robots, to change th...
The aim of this article is to revisit Dalal’s operator for belief revision. Dalal has proposed a technique for revising belief bases based on the minimization of a distance betw...