نتایج جستجو برای: compatible pairs
تعداد نتایج: 160317 فیلتر نتایج به سال:
We propose a learning-based method of estimating the compatibility between vocal and accompaniment audio tracks, i.e. , how well they go with each other when played simultaneously. This task is challenging because it difficult to formulate hand-crafted rules or construct large labeled dataset p...
We introduce Legendre sequences and generalised Legendre pairs (G Lpairs). We show how to construct an Hadamard matrix of order 2£ + 2 from a GL-pair of length f. We review the known constructions for GLpairs and use the discrete Fourier transform (DFT) and power spectral density (PSD) to enable an exhaustive search for GL-pairs for lengths f ::::; 47 and partial searches for other f, 1 Definit...
PENGUIN is a grammar-based language for programming graphical user interfaces. Code for each thread of control in a multi-threaded application is confined to its own module, promoting modularity and reuse of code. Networks of PENGUIN components (each composed of an arbitrary number of modules) can be used to construct large reactive systems with parallel execution, internal protection boundarie...
We present instances of MPKCs (multivariate public key cryptosystems) with design, given the best attacks we know, and implement them on commodity PC hardware. We also show that they can hold their own compared to traditional alternatives. In fact, they can be up to an order of magnitude faster.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید