3875 search results - page 132 / 775 » Approximation algorithms for the 0-extension problem |
108
click to vote
AAAI
2008
15 years 7 months ago
2008
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
126
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
104
Voted
CORR
2011
Springer
14 years 11 months ago
2011
Springer
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
133
Voted
ASPDAC
2007
ACM
15 years 8 months ago
2007
ACM
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
159
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...