Sciweavers

291 search results - page 6 / 59
» Approximate centerpoints with proofs
Sort
View
SIAMCOMP
2000
88views more  SIAMCOMP 2000»
13 years 10 months ago
Gadgets, Approximation, and Linear Programming
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, Dav...
MA
2011
Springer
246views Communications» more  MA 2011»
13 years 5 months ago
On the Gaussian approximation of vector-valued multiple integrals
: By combining the findings of two recent, seminal papers by Nualart, Peccati and Tudor, we get that the convergence in law of any sequence of vector-valued multiple integrals Fn ...
Salim Noreddine, Ivan Nourdin
TVCG
2010
174views more  TVCG 2010»
13 years 8 months ago
Subdivision Analysis of the Trilinear Interpolant
— Isosurfaces are fundamental volumetric visualization tools, and are generated by the well-known Marching Cubes cases that approximate contours of trilinearly-interpolated scala...
Hamish Carr, Nelson Max
IPL
2011
73views more  IPL 2011»
13 years 5 months ago
Maximum subset intersection
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
Raphaël Clifford, Alexandru Popa
CSFW
2007
IEEE
14 years 4 months ago
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Roberto Segala, Andrea Turrini