Sciweavers

9842 search results - page 224 / 1969
» Problem complexity
Sort
View
134
Voted
COMPUTING
2010
15 years 1 days ago
Modified HSS iteration methods for a class of complex symmetric linear systems
In this paper, we introduce and analyze a modification of the Hermitian and skewHermitian splitting iteration method for solving a broad class of complex symmetric linear systems....
Zhong-Zhi Bai, Michele Benzi, Fang Chen
111
Voted
TWC
2010
14 years 9 months ago
A Reduced-Complexity PTS-Based PAPR Reduction Scheme for OFDM Systems
In this paper, a reduced-complexity partial transmit sequences (PTS) scheme is proposed to resolve the intrinsic high peak-to-average power ratio (PAPR) problem of orthogonal frequ...
Sheng-Ju Ku, Chin-Liang Wang, Chiuan-Hsu Chen
113
Voted
HEURISTICS
2010
14 years 9 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
Claude-Guy Quimper, Louis-Martin Rousseau
113
Voted
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
15 years 8 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
116
Voted
COMSIS
2010
15 years 23 hour ago
Multi-video summarization using complex graph clustering and mining
Multi-video summarization is a great theoretical and technical challenge due to the wider diversity of topics in multi-video than singlevideo as well as the multi-modality nature o...
Jian Shao, Dongming Jiang, Mengru Wang, Hong Chen,...