Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
We introduce a new method that characterizes typical local image features (e.g., SIFT [9], phase feature [3]) in terms of their distinctiveness, detectability, and robustness to i...
Abstract—This paper describes a system, referred to as modelbased expectation-maximization source separation and localization (MESSL), for separating and localizing multiple soun...
Michael I. Mandel, Ron J. Weiss, Daniel P. W. Elli...
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Developing techniques for mobile robot navigation constitutes one of the major trends in the current research on mobile robotics. This paper develops a local model network (LMN) fo...