3096 search results - page 109 / 620 » The Generalized FITC Approximation |
ITICSE
2004
ACM
14 years 2 months ago
2004
ACM
This paper describes a knowledge unit and the use of a software tool, DesignMentor, for teaching a very challenging topic in computer graphics and visualization, namely: curve and...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
SIAMCOMP
2010
13 years 3 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
We provide a general framework for learning precise, compact, and fast representations of the Bayesian predictive distribution for a model. This framework is based on minimizing t...
SIGECOM
2004
ACM
14 years 2 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...