1469 search results - page 119 / 294 » Approximate polynomial decomposition |
135
click to vote
CASES
2005
ACM
15 years 7 months ago
2005
ACM
Due to resource and power constraints, embedded processors often cannot afford dedicated floating-point units. For instance, the IBM PowerPC processor embedded in Xilinx Virtex-...
129
click to vote
UAI
2004
15 years 6 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...
115
Voted
ECCV
1996
Springer
16 years 6 months ago
1996
Springer
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-redu...
171
Voted
COMPGEOM
2005
ACM
15 years 7 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
164
Voted
3DGIS
2006
Springer
15 years 11 months ago
2006
Springer
Within the paper, a novel approach for the reconstruction of geometric details of building façades is presented. It is based on 3D point clouds from terrestrial laser scanning. B...