A generalized image model (GIM) is presented. Images are represented as sets of four-dimensional (4D) sites combining position and intensity information, as well as their associat...
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Most conventional SFS (shape from shading) algorithms have been developed under three basic assumptions on surface properties and imaging geometry to simplify the problem, namely, ...
Kyoung Mu Lee (Seoul National University), C.-C. J...
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Data analysis applications typically aggregate data across many dimensions looking for anomalies or unusual patterns. The SQL aggregate functions and the GROUP BY operator produce ...
Jim Gray, Surajit Chaudhuri, Adam Bosworth, Andrew...