This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly i...
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the first modeling language to combine high-level algebraic and set notation...
Pascal Van Hentenryck, Laurent Michel, Philippe La...
Previous work on context-specific independence in Bayesian networks is driven by a common goal, namely to represent the conditional probability tables in a most compact way. In th...
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...
Giuseppe Destino, Giuseppe Thadeu Freitas de Abreu