Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Program transformation systems provide one means of formally deriving a program from its speci cation. The main advantage of this development method is that the executable program...
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Background estimation and removal based on the joint use of range and color data produces superior results than can be achieved with either data source alone. This is increasingly...
Gaile G. Gordon, Trevor Darrell, Michael Harville,...
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...