815 search results - page 130 / 163 » Approximate Entropy Reducts |
COLT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
158
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
Given a lattice basis of n vectors in Zn, we propose an algorithm using 12n3 + O(n2) floating point operations for checking whether the basis is LLL-reduced. If the basis is redu...
3DPVT
2006
IEEE
15 years 5 months ago
2006
IEEE
Obtaining a digital model of a real-world 3D scene is a challenging task pursued by computer vision and computer graphics. Given an initial approximate 3D model, a popular refinem...
DATE
2006
IEEE
15 years 5 months ago
2006
IEEE
Conventional high-level synthesis uses the worst case delay to relate all inputs to all outputs of an operation. This is a very conservative approximation of reality, especially i...