534 search results - page 26 / 107 » Efficient polynomial L-approximations |
ICCAD
2006
IEEE
14 years 4 months ago
2006
IEEE
DATE
2009
IEEE
14 years 2 months ago
2009
IEEE
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
UAI
2004
13 years 9 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
CAD
2006
Springer
13 years 7 months ago
2006
Springer
A robust and efficient algorithm for trimming both local and global self-intersections in offset curves and surfaces is presented. Our scheme is based on the derivation of a ratio...