This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
Information extraction from large data repositories is critical to Information Management solutions. In addition to prerequisite corpus analysis, to determine domain-specific char...
Youssef Drissi, Branimir Boguraev, David Ferrucci,...
Effective personalization is greatly demanded in highly heterogeneous and diverse e-commerce domain. In our approach we rely on the idea that an effective personalization techniqu...
This paper introduces a new approach to provide users with solutions to explore a domain via an information space. A key point in our approach is that information searching and ex...
Variable selection for cluster analysis is a difficult problem. The difficulty originates not only from the lack of class information but also the fact that high-dimensional data ...
Leonard K. M. Poon, Nevin Lianwen Zhang, Tao Chen,...