This paper describes how to propagate approximately additive random perturbations through any kind of vision algorithm step in which the appropriate random perturbation model for the estimated quantity produced by the vision step is also an additive random perturbation. We assume that the vision algorithm step can be modeled as a calculation (linear or non-linear) that produces an estimate that...

Taylor series expansions of turbulent time correlation functions are applied to show that helicity influences Eulerian time correlations more strongly than Lagrangian time correlations: to second order in time, the hclicity effect on Lagrangian time correlations vanishes, but the helicity cffect on Eulerian time correlations is nonzero. Fourier analysis shows that the hclicity effect on Euleria...

Search systems are typically evaluated by averaging an effectiveness measure over a set of queries. However, this method does not capture the the robustness of the retrieval approach, as measured by its variability across queries. Robustness can be a critical retrieval property, especially in settings such as commercial search engines that must build user trust and maintain brand quality. This ...

We study random walks whose increments are α-stable distributions with shape parameter 1 < α < 2. Specifically, assuming a mean increment size which is negative, we provide series expansions in terms of the mean increment size for the probability that the all-time maximum of an α-stable random walk is equal to zero and, in the totally skewed to the left case of skewness parameter β = −1, for th...

As archives contain documents that span over a long period of time, the language used to create these documents and the language used for querying the archive can differ. This difference is due to evolution in both terminology and semantics and will cause a significant number of relevant documents being omitted. A static solution is to use query expansion based on explicit knowledge banks such ...

We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r, ∇r(G). For these classes we prove the existence of several partition results such as the existence of low tree-width and low tree-depth colorings. This ge...

This paper describes the participation of the University of Washington Computational Linguistics Laboratory (UWCL) in the Similar Segments in Social Speech task at MediaEval 2013. Participants in this task develop systems that, given a span of speech from a recorded conversation, aim to identify all and only highly similar regions in other recordings. As this was a new task for this year, the g...

Abstract. Let K be any unital commutative Q-algebra and z = (z1, z2, · · · , zn) commutative or noncommutative variables. Let t be a formal central parameter and K[[t]]〈〈z〉〉 the formal power series algebra of z over K[[t]]. In [Z6], for each automorphism Ft(z) = z−Ht(z) of K[[t]]〈〈z〉〉 with Ht=0(z) = 0 and o(H(z)) ≥ 1, a NCS (noncommutative symmetric) system ([Z5]) ΩFt has been constructed. Cons...

Two novel problems straddling the boundary between image retrieval and data mining are formulated: for every pixel in the query image, (i) find the database image with the maximum resolution depicting the pixel and (ii) find the frequency with which it is photographed in detail. An efficient and reliable solution for both problems is proposed based on two novel techniques, the hierarchical quer...

The University of Exeter group participated in the monolingual, bilingual and multilingual-4 retrieval tasks this year. The main focus of our investigation this year was the small multilingual task comprising four languages, French, German, Spanish and English. We adopted a document translation strategy and tested four merging techniques to combine results from the separate document collections...