Search results for "complexi"
showing 10 items of 1116 documents
Video preprocessing for audiovisual indexing
2003
We address the problem of detecting shots of subjects that are interviewed in news sequences. This is useful since usually these kinds of scenes contain important and reusable information that can be used for other news programs. In a previous paper, we presented a technique based on a priori knowledge of the editing techniques used in news sequences which allowed a fast search of news stories (see Albiol, A. et al., 3rd Int. Conf. on Audio and Video-based Biometric Person Authentication, p.366-71, 2001). We now present a new shot descriptor technique which improves the previous search results by using a simple, yet efficient, algorithm, based on the information contained in consecutive fra…
A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY
2013
Motivated by the extension of the critical factorization theorem to infinite words, we study the (local) periodicity function, i.e. the function that, for any position in a word, gives the size of the shortest square centered in that position. We prove that this function characterizes any binary word up to exchange of letters. We then introduce a new complexity function for words (the periodicity complexity) that, for any position in the word, gives the average value of the periodicity function up to that position. The new complexity function is independent from the other commonly used complexity measures as, for instance, the factor complexity. Indeed, whereas any infinite word with bound…
Learning-Graph-Based Quantum Algorithm for k-distinctness
2012
We present a quantum algorithm solving the $k$-distinctness problem in $O(n^{1-2^{k-2}/(2^k-1)})$ queries with a bounded error. This improves the previous $O(n^{k/(k+1)})$-query algorithm by Ambainis. The construction uses a modified learning graph approach. Compared to the recent paper by Belovs and Lee arXiv:1108.3022, the algorithm doesn't require any prior information on the input, and the complexity analysis is much simpler. Additionally, we introduce an $O(\sqrt{n}\alpha^{1/6})$ algorithm for the graph collision problem where $\alpha$ is the independence number of the graph.
Angular analysis of charged and neutral B → Kμ + μ − decays
2014
The angular distributions of the rare decays B → K+µ+µ- and B0 → K0 <inf>a</inf>Sμ+μ- are studied with data corresponding to 3 fb-1 of integrated luminosity, collected in proton-proton collisions at 7 and 8TeV centre-of-mass energies with the LHCb detector. The angular distribution is described by two parameters, FH and the forward-backward asymmetry of the dimuon system AFB, which are determined in bins of the dimuon mass squared. The parameter F<inf>H</inf> is a measure of the contribution from (pseudo)scalar and tensor amplitudes to the decay width. The measurements of A<inf>FB</inf> and F<inf>H</inf> reported here are the most precise to d…
Measurement of CP asymmetry in Bs0 → Ds ∓K± decays
2014
Journal of high energy physics 2018(3), 59 (2018). doi:10.1007/JHEP03(2018)059
Observation of an Excited $B^{\pm}_c$ Meson State with the ATLAS Detector
2014
A search for excited states of the B±c meson is performed using 4.9 fb-1 of 7 TeV and 19.2 fb-1 of 8 TeV pp collision data collected by the ATLAS experiment at the LHC. A new state is observed through its hadronic transition to the ground state, with the latter detected in the decay B±c→J/ψπ±. The state appears in the m(Bc±π+π-)-m(Bc±)-2m(π±) mass difference distribution with a significance of 5.2 standard deviations. The mass of the observed state is 6842±4±5 MeV, where the first error is statistical and the second is systematic. The mass and decay of this state are consistent with expectations for the second S-wave state of the B±c meson, B±c(2S).
Dynamic Gaussian Graphical Models for Modelling Genomic Networks
2014
After sequencing the entire DNA for various organisms, the challenge has become understanding the functional interrelatedness of the genome. Only by understanding the pathways for various complex diseases can we begin to make sense of any type of treatment. Unfortunately, decyphering the genomic network structure is an enormous task. Even with a small number of genes the number of possible networks is very large. This problem becomes even more difficult, when we consider dynamical networks. We consider the problem of estimating a sparse dynamic Gaussian graphical model with \(L_1\) penalized maximum likelihood of structured precision matrix. The structure can consist of specific time dynami…
Matching beer with food : pairing principles, underlying mechanisms and a focus on aromatic similarity
2018
Pairing between beer and dishes emerges as a new trend in France. Beer promoters or gastronomy professionals need to offer high-quality advices in terms of beer and food pairing to their customers. Within this context, the objective of the research was to identify pairing principles and to better understand the underlying perceptual mechanisms. Determinants of food and beverage pairing were first analysed from experts’ discourses. Results showed that food and beverage pairings are governed by perceptual, conceptual and affective features, related to physio-chemical, perceptual and cognitive processes. Experts often mentioned “Aromatic Similarity” as one of the main pairing principles. This …
Visual category representations in the infant brain
2021
SUMMARYVisual categorization is a human core cognitive capacity1,2that depends on the development of visual category representations in the infant brain3–7. However, the exact nature of infant visual category representations and their relationship to the corresponding adult form remains unknown8. Our results clarify the nature of visual category representations from electroencephalography (EEG) data in 6- to 8-month-old infants and their developmental trajectory towards adult maturity in the key characteristics of temporal dynamics2,9, representational format10–12, and spectral properties13,14. Temporal dynamics change from slowly emerging, developing representations in infants to quickly e…
Fast Algorithms for Pseudoarboricity
2015
The densest subgraph problem, which asks for a subgraph with the maximum edges-to-vertices ratio d∗, is solvable in polynomial time. We discuss algorithms for this problem and the computation of a graph orientation with the lowest maximum indegree, which is equal to ⌈d∗⌉. This value also equals the pseudoarboricity of the graph. We show that it can be computed in O(|E| √ log log d∗) time, and that better estimates can be given for graph classes where d∗ satisfies certain asymptotic bounds. These runtimes are achieved by accelerating a binary search with an approximation scheme, and a runtime analysis of Dinitz’s algorithm on flow networks where all arcs, except the source and sink arcs, hav…