113 search results - page 17 / 23 » Fast algorithms for discrete polynomial transforms |
SAC
2006
ACM
14 years 2 months ago
2006
ACM
Several different techniques and softwares intend to improve the accuracy of results computed in a fixed finite precision. Here we focus on a method to improve the accuracy of ...
JMLR
2010
13 years 3 months ago
2010
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
KDD
2001
ACM
14 years 9 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
ACCV
1998
Springer
14 years 25 days ago
1998
Springer
One of the important problems related to image analysis and compression is finding repeated structure. Although the focus of this paper is developing digital geometric models and m...
ACMICEC
2007
ACM
14 years 18 days ago
2007
ACM
Bids during an online auction arrive at unequally-spaced discrete time points. Our goal is to capture the entire continuous price-evolution function by representing it as a functi...