550 search results - page 40 / 110 » Inherently Parallel Geometric Computations |
FOCS
1993
IEEE
14 years 2 months ago
1993
IEEE
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
SGP
2007
14 years 8 days ago
2007
Discrete Laplace operators are ubiquitous in applications spanning geometric modeling to simulation. For robustness and efficiency, many applications require discrete operators th...
ICCV
2009
IEEE
13 years 7 months ago
2009
IEEE
In this work, we present a technique for robust estimation, which by explicitly incorporating the inherent uncertainty of the estimation procedure, results in a more efficient rob...
OTM
2007
Springer
14 years 4 months ago
2007
Springer
Practical scalability of Description Logic (DL) reasoning is an important premise for the adoption of OWL in a real-world setting. Many highly efficient optimizations for the DL ta...
PVM
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Domain decomposition for regular meshes on parallel computers has traditionally been performed by attempting to exactly partition the work among the available processors ...