2223 search results - page 239 / 445 » Ontological Framework for Approximation |
150
click to vote
VISUALIZATION
2000
IEEE
15 years 9 months ago
2000
IEEE
The techniques for reducing the size of a volume dataset by preserving both the geometrical/topological shape and the information encoded in an attached scalar field are attractin...
150
click to vote
WSC
2008
15 years 7 months ago
2008
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
165
click to vote
COCOA
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
175
click to vote
AAAI
2010
15 years 6 months ago
2010
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
147
click to vote
ACL
2007
15 years 6 months ago
2007
We introduce a framework for syntactic parsing with latent variables based on a form of dynamic Sigmoid Belief Networks called Incremental Sigmoid Belief Networks. We demonstrate ...