Sciweavers

1819 search results - page 246 / 364
» Computability and Representations of the Zero Set
Sort
View
SMA
2005
ACM
167views Solid Modeling» more  SMA 2005»
15 years 12 months ago
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
Peter Hachenberger, Lutz Kettner
ATAL
2005
Springer
15 years 12 months ago
Modeling exceptions via commitment protocols
This paper develops a model for exceptions and an approach for incorporating them in commitment protocols among autonomous agents. Modeling and handling exceptions is critical for...
Ashok U. Mallya, Munindar P. Singh
HPDC
2010
IEEE
15 years 7 months ago
Scalability of communicators and groups in MPI
As the number of cores inside compute clusters continues to grow, the scalability of MPI (Message Passing Interface) is important to ensure that programs can continue to execute o...
Humaira Kamal, Seyed M. Mirtaheri, Alan Wagner
BMCBI
2011
15 years 1 months ago
A discriminative method for family-based protein remote homology detection that combines inductive logic programming and proposi
Background: Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequenc...
Juliana S. Bernardes, Alessandra Carbone, Gerson Z...
CVPR
2011
IEEE
14 years 10 months ago
Topologically-Robust 3D Shape Matching Based on Diffusion Geometry and Seed Growing
3D Shape matching is an important problem in computer vision. One of the major difficulties in finding dense correspondences between 3D shapes is related to the topological disc...
Avinash Sharma, Radu Horaud, Jan Cech, Edmond Boye...