Sciweavers

2766 search results - page 197 / 554
» Algorithms for trigonometric polynomials
Sort
View
ANOR
2002
88views more  ANOR 2002»
15 years 4 months ago
Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are ...
Horst W. Hamacher, Martine Labbé, Stefan Ni...
CORR
2000
Springer
81views Education» more  CORR 2000»
15 years 4 months ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman
MOR
2000
90views more  MOR 2000»
15 years 4 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger
ASPDAC
2010
ACM
135views Hardware» more  ASPDAC 2010»
15 years 2 months ago
Statistical timing verification for transparently latched circuits through structural graph traversal
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
Xingliang Yuan, Jia Wang
123
Voted
ICPR
2010
IEEE
15 years 2 months ago
Learning Virtual HD Model for Bi-model Emotional Speaker Recognition
Pitch mismatch between training and testing is one of the important factors causing the performance degradation of the speaker recognition system. In this paper, we adopted the mis...
Ting Huang, Yingchun Yang