Sciweavers

2477 search results - page 86 / 496
» Approximate extended formulations
Sort
View
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
15 years 5 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
CG
2006
Springer
15 years 4 months ago
Approximate collision response using closest feature maps
In this paper we consider the novel idea of closest feature maps (CFMs) applied to refinable collision response in order to address the potential issues and problems associated wi...
Thanh Giang, Carol O'Sullivan
JSCIC
2007
89views more  JSCIC 2007»
15 years 3 months ago
Adjoint Recovery of Superconvergent Linear Functionals from Galerkin Approximations. The One-dimensional Case
In this paper, we extend the adjoint error correction of Pierce and Giles [SIAM Review, 42 (2000), pp. 247-264] for obtaining superconvergent approximations of functionals to Gale...
Bernardo Cockburn, Ryuhei Ichikawa
CGF
2002
107views more  CGF 2002»
15 years 3 months ago
Geometric Approximations Towards Free Specular Comic Shading
We extend the standard solution to comic rendering with a comic-style specular component. To minimise the computational overhead associated with this extension, we introduce two o...
Holger Winnemöller, Shaun Bangay
JGAA
2000
179views more  JGAA 2000»
15 years 3 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao