Sciweavers

840 search results - page 18 / 168
» The Complexity of the Extended GCD Problem
Sort
View
ICASSP
2008
IEEE
15 years 4 months ago
On quantifying the effects of noncircularity on the complex fastica algorithm
The complex fast independent component analysis (c-FastICA) algorithm is one of the most popular methods for solving the ICA problem with complex-valued data. In this study, we ex...
Mike Novey, Tülay Adali
68
Voted
TCS
2008
14 years 9 months ago
Itemset frequency satisfiability: Complexity and axiomatization
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
Toon Calders
DISOPT
2006
155views more  DISOPT 2006»
14 years 9 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Dorit S. Hochbaum, Asaf Levin
TSMC
2008
94views more  TSMC 2008»
14 years 9 months ago
Test Sequencing in Complex Manufacturing Systems
Testing complex manufacturing systems, such as an ASML [1] lithographic machine, takes up to 45% of the total development time of a system. The problem of which tests must be execu...
R. Boumen, I. S. M. de Jong, J. W. H. Vermunt, J. ...
ESORICS
2009
Springer
15 years 10 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo