In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
This paper presents the results of LILY, which is an ontology mapping system, for OAEI 2007 campaign. To accurately describe what the real meaning of an entity in the original onto...
Abstract— Probabilistic roadmaps (PRM) have been demonstrated to be very promising for planning paths for robots with high degrees of freedom in complex 3D workspaces. In this pa...
Khaled Belghith, Froduald Kabanza, Leo Hartman, Ro...
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...