3875 search results - page 639 / 775 » Approximation algorithms for the 0-extension problem |
156
click to vote
SIGGRAPH
1992
ACM
15 years 9 months ago
1992
ACM
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1; : : : ; xng IR3 on or near an unknown manifold M, and produces as output a simplicia...
150
click to vote
ASPDAC
2007
ACM
15 years 9 months ago
2007
ACM
In the paper, we develop a systematic methodology for modeling sampled interconnect frequency response data based on spline interpolation. Through piecewise polynomial interpolatio...
193
click to vote
CISS
2007
IEEE
15 years 9 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
145
click to vote
FCS
2008
15 years 7 months ago
2008
Abstract. Autonomous scheduling deals with the problem - how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their t...
172
click to vote
IMAMS
2007
15 years 7 months ago
2007
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...