Sciweavers

8669 search results - page 183 / 1734
» Computing matrix representations
Sort
View
ICCS
2005
Springer
14 years 2 months ago
Generating Parallel Algorithms for Cluster and Grid Computing
We revisit and use the dependence transformation method to generate parallel algorithms suitable for cluster and grid computing. We illustrate this method in two applications: to o...
Ulisses Kendi Hayashida, Kunio Okuda, Jairo Panett...
ISPAN
2002
IEEE
14 years 2 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
IJCV
2000
133views more  IJCV 2000»
13 years 9 months ago
Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint
We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algor...
Yoram Leedan, Peter Meer
CPHYSICS
2007
126views more  CPHYSICS 2007»
13 years 9 months ago
Adaptive continuation algorithms for computing energy levels of rotating Bose-Einstein condensates
We describe adaptive continuation algorithms for computing energy levels of the Bose–Einstein condensates (BEC) with emphasis on the rotating BEC. We show that the rotating BEC ...
S.-L. Chang, C.-S. Chien
ICRA
1993
IEEE
118views Robotics» more  ICRA 1993»
14 years 1 months ago
Mechanical Computation for Passive Force Control
Force control implemented by a passive mechanical device (perhaps a wrist) has inherent advantages over active implementations. A passive mechanical device can regain some of the ...
Ambarish Goswami, Michael A. Peshkin