Sciweavers

2280 search results - page 180 / 456
» Global Optimization for Optimal Generalized Procrustes Analy...
Sort
View
FSTTCS
2004
Springer
16 years 2 days ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
CASCON
1996
89views Education» more  CASCON 1996»
15 years 8 months ago
A comparison of algorithms for interprocedural class analysis
Message passing overhead is often a substantial source of runtime overhead in object-oriented applications. To combat this performance problem, a number of techniques have been de...
David Grove
LCTRTS
1998
Springer
15 years 11 months ago
Automatic Accurate Time-Bound Analysis for High-Level Languages
This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence ...
Yanhong A. Liu, Gustavo Gomez
IJCNN
2006
IEEE
16 years 21 days ago
Relative Gradient Learning for Independent Subspace Analysis
Abstract— Independent subspace analysis (ISA) is a generalization of independent component analysis (ICA), where multidimensional ICA is incorporated with the idea of invariant f...
Heeyoul Choi, Seungjin Choi
SIAMJO
2002
105views more  SIAMJO 2002»
15 years 6 months ago
An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs
We consider the interior-point approach to sensitivity analysis in linear programming developed by the authors. We investigate the quality of the interior-point bounds under degene...
E. Alper Yildirim, Michael J. Todd