6266 search results - page 90 / 1254 » New results on the computability and complexity of points - ... |
AAAI
1990
13 years 10 months ago
1990
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
COMGEO
2007
ACM
13 years 9 months ago
2007
ACM
A new algorithm is presented for surface reconstruction from unorganized points. Unlike many previous algorithms, this algorithm does not select a subcomplex of the Delaunay Trian...
TPDS
2002
13 years 8 months ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
CAD
2005
Springer
13 years 8 months ago
2005
Springer
This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The pro...
ISCAS
2007
IEEE
14 years 3 months ago
2007
IEEE
— Multiview video coding (MVC) systems require much more bandwidth and computational complexity relative to mono-view video systems. Thus, when designing a VLSI architecture for ...