Sciweavers

322 search results - page 9 / 65
» Algorithms for Large Integer Matrix Problems
Sort
View
ASPDAC
2008
ACM
93views Hardware» more  ASPDAC 2008»
13 years 9 months ago
Scheduling with integer time budgeting for low-power optimization
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
Wei Jiang, Zhiru Zhang, Miodrag Potkonjak, Jason C...
EVOW
2007
Springer
14 years 1 months ago
A Hybrid Method for Solving Large-Scale Supply Chain Problems
Abstract. The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be op...
Steffen Wolf, Peter Merz
TKDE
2012
270views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...
SIAMJO
2010
246views more  SIAMJO 2010»
13 years 6 months ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...
IJBC
2008
81views more  IJBC 2008»
13 years 7 months ago
On the Location and Continuation of Hopf bifurcations in Large-Scale Problems
CL_MATCONT is a MATLAB package for the study of dynamical systems and their bifurcations. It uses a minimally augmented system for continuation of the Hopf curve. The Continuation...
M. Friedman, W. Qiu