6110 search results - page 124 / 1222 » Approximate Computing |
184
click to vote
SIAMMAX
2010
15 years 1 months ago
2010
For the approximation of time-dependent data tensors and of solutions to tensor differential equations by tensors of low Tucker rank, we study a computational approach that can be ...
145
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
163
click to vote
BIBE
2005
IEEE
16 years 14 hour ago
2005
IEEE
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
190
click to vote
SCALESPACE
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Gaussian convolutions are perhaps the most often used image operators in low-level computer vision tasks. Surprisingly though, there are precious few articles that descri...
191
click to vote
JAIR
2008
15 years 6 months ago
2008
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...