4761 search results - page 94 / 953 » Generalizing Boundary Points |
MICCAI
2003
Springer
14 years 9 months ago
2003
Springer
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...
ICML
2003
IEEE
14 years 9 months ago
2003
IEEE
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...
Publication
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, ...
CCCG
2007
13 years 9 months ago
2007
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...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
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 ...