Sciweavers

3897 search results - page 126 / 780
» complexity 2010
Sort
View
JMLR
2010
152views more  JMLR 2010»
13 years 5 months ago
Stochastic Composite Likelihood
Maximum likelihood estimators are often of limited practical use due to the intensive computation they require. We propose a family of alternative estimators that maximize a stoch...
Joshua V. Dillon, Guy Lebanon
EOR
2010
96views more  EOR 2010»
13 years 10 months ago
The hybrid flow shop scheduling problem
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many r...
Rubén Ruiz, José Antonio Vázq...
TASLP
2010
148views more  TASLP 2010»
13 years 5 months ago
Batch and Adaptive PARAFAC-Based Blind Separation of Convolutive Speech Mixtures
We present a frequency-domain technique based on PARAllel FACtor (PARAFAC) analysis that performs multichannel blind source separation (BSS) of convolutive speech mixtures. PARAFAC...
Dimitri Nion, Kleanthis N. Mokios, Nicholas D. Sid...
IEEEHPCS
2010
13 years 8 months ago
Timed protocols insecurity problem is NP-complete
—In this paper we study the protocol insecurity problem for time dependent security protocols with a finite number of sessions, extending to the timed case the results of M. Rus...
Massimo Benerecetti, Nicola Cuomo, Adriano Peron
OTM
2010
Springer
13 years 8 months ago
SMILE - A Framework for Semantic Applications
Abstract. Even though the semantic web become actual topic of research recently, there are no complex solutions for building semantic applications yet to our best knowledge. We des...
Jakub Galgonek, Tomas Knap, Martin Krulis, Martin ...