Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
Some real-world problems are partially decomposable, in that they can be decomposed into a set of coupled subproblems, that are each relatively easy to solve. However, when these ...
In this paper, we propose a transmit beamspace energy focusing technique for multiple-input multiple-output (MIMO) radar with application to direction finding for multiple targets...
In this paper, we investigate the process of searching for images of specified people in the consumer family photo domain. This domain is very different from the controlled enviro...
Andrew C. Gallagher, Madirakshi Das, Alexander C. ...
Color is known to be highly discriminative for many object recognition tasks, but is difficult to infer from uncontrolled images in which the illuminant is not known. Traditional...
Trevor Owens, Kate Saenko, Trevor Darrell, Ayan Ch...