Sciweavers

19320 search results - page 433 / 3864
» On the complexity of computing determinants
Sort
View
CSDA
2008
65views more  CSDA 2008»
15 years 7 months ago
Improving updating rules in multiplicative algorithms for computing D-optimal designs
In this paper we discuss a class of multiplicative algorithms for computing D-optimal designs for regression models on a finite design space. We prove a monotonicity result for a ...
Holger Dette, Andrey Pepelyshev, Anatoly A. Zhiglj...
JIB
2006
102views more  JIB 2006»
15 years 7 months ago
3D image and graph based Computation of Protein Surface
The accessible surface of a macromolecule is a significant determinant of its action. The interaction between biomolecules or protein-ligand is dependent on their surfaces rather ...
A. Ranganath, K. C. Shet, N. Vidyavathi
CORR
2002
Springer
123views Education» more  CORR 2002»
15 years 7 months ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler
MOC
2000
74views more  MOC 2000»
15 years 7 months ago
Computing the tame kernel of quadratic imaginary fields
J. Tate has determined the group K2OF (called the tame kernel) for six quadratic imaginary number fields F = Q( d), where d = -3, -4, -7, -8, -11, -15. Modifying the method of Tat...
Jerzy Browkin, Karim Belabas, Herbert Gangl
PRL
2007
158views more  PRL 2007»
15 years 7 months ago
Stability and convergence of the level set method in computer vision
Several computer vision problems, like segmentation, tracking and shape modeling, are increasingly being solved using level set methodologies. But the critical issues of stability...
Kunal N. Chaudhury, K. R. Ramakrishnan