Sciweavers

58 search results - page 12 / 12
» Subexponential Algorithms for Partial Cover Problems
Sort
View
COMPGEOM
1994
ACM
13 years 7 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 3 months ago
Termination Detection of Local Computations
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...
Emmanuel Godard, Yves Métivier, Gerard Tel
SCALESPACE
2007
Springer
13 years 9 months ago
Faithful Recovery of Vector Valued Functions from Incomplete Data
On March 11, 1944, the famous Eremitani Church in Padua (Italy) was destroyed in an Allied bombing along with the inestimable frescoes by Andrea Mantegna et al. contained in the Ov...
Massimo Fornasier