Sciweavers

46 search results - page 8 / 10
» Efficient algorithms for large-scale local triangle counting
Sort
View
SPAA
1996
ACM
13 years 11 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
IMR
2004
Springer
14 years 25 days ago
Reliable Isotropic Tetrahedral Mesh Generation Based on an Advancing Front Method
In this paper, we propose a robust isotropic tetrahedral mesh generation method. An advancing front method is employed to control local mesh density and to easily preserve the ori...
Yasushi Ito, Alan M. Shih, Bharat K. Soni
CAD
2005
Springer
13 years 7 months ago
Surface interpolation of meshes by geometric subdivision
Subdivision surfaces are generated by repeated approximation or interpolation from initial control meshes. In this paper, two new nonlinear subdivision schemes, face based subdivi...
Xunnian Yang
BMCBI
2010
148views more  BMCBI 2010»
13 years 7 months ago
Structuring heterogeneous biological information using fuzzy clustering of k-partite graphs
Background: Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the inter...
Mara L. Hartsperger, Florian Blöchl, Volker S...
ICPR
2008
IEEE
14 years 8 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson