Sciweavers

5100 search results - page 264 / 1020
» The Linear Complexity of a Graph
Sort
View
AMC
2010
175views more  AMC 2010»
15 years 4 months ago
An inexact parallel splitting augmented Lagrangian method for large system of linear equations
: Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse sy...
Zheng Peng, DongHua Wu
SIAMSC
2008
129views more  SIAMSC 2008»
15 years 4 months ago
Bottom-Up Construction and 2: 1 Balance Refinement of Linear Octrees in Parallel
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
Hari Sundar, Rahul S. Sampath, George Biros
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 4 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
WCNC
2008
IEEE
15 years 10 months ago
Novel Ultra Wideband Low Complexity Ranging Using Different Channel Statistics
—UWB technology can reach centimetre level ranging and positioning accuracy in LOS propagation when time of arrival techniques are used. However, in a real positioning system, th...
Giovanni Bellusci, Gerard J. M. Janssen, Junlin Ya...
EGH
2003
Springer
15 years 9 months ago
CULLIDE: interactive collision detection between complex models in large environments using graphics hardware
We present a novel approach for fast collision detection between multiple deformable and breakable objects in a large environment using graphics hardware. Our algorithm takes into...
Naga K. Govindaraju, Stephane Redon, Ming C. Lin, ...