Sciweavers

754 search results - page 44 / 151
» Local Monotonicity Reconstruction
Sort
View
95
Voted
VISUALIZATION
1997
IEEE
15 years 1 months ago
Multiresolution compression and reconstruction
This paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being ...
Oliver G. Staadt, Markus H. Gross, Roger Weber
AI
2000
Springer
14 years 9 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
SIAMIS
2008
174views more  SIAMIS 2008»
14 years 9 months ago
Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
We consider the restoration of piecewise constant images where the number of the regions and their values are not fixed in advance, with a good difference of piecewise constant val...
Mila Nikolova, Michael K. Ng, Shuqin Zhang, Wai-Ki...
ICIAP
2007
ACM
15 years 9 months ago
Topology Preserving Marching Cubes-like Algorithms on the Face-Centered Cubic Grid
The well-known marching cubes algorithm is modified to apply to the face-centered cubic (fcc) grid. Thus, the local configurations that are considered when extracting the local su...
Robin Strand, Peer Stelldinger
STOC
2002
ACM
117views Algorithms» more  STOC 2002»
15 years 10 months ago
Hardness amplification within NP
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant ? > 0 such that if there is some l...
Ryan O'Donnell