family of self-similar 2D Gabor wavelets. We therefore derive the conditions under which a set of continuous 2D Gabor wavelets will provide a complete representation of any image, and we also find self-similar wavelet parameterizations which allow stable reconstruction by summation as though the wavelets

Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data.. The most promising solutions' involve performing dimensionality reduction on the data, then indexing the reduced

domains. Our results suggest a significantly more refined picture of community structure in large real-world networks than has been appreciated previously. Our most striking finding is that in nearly every network dataset we examined, we observe tight but almost trivial communities at very small scales

that the performance ratio of the greedy algorithm is, in fact, exactly ln m \Gamma ln ln m+ \Theta(1), where m is the size of the ground set. The difference between the upper and lower bounds turns out to be less than 1:1. This provides the first tight analysis of the greedy algorithm, as well as the first upper

Data cleaning based on similarities involves identification of “close ” tuples, where closeness is evaluated using a variety of similarity functions chosen to suit the domain and application. Current approaches for efficiently implementing such similarity joins are tightly tied to the chosen

read request in a total of two RISC instructions. We have implemented an RTL model of an off-chip memory-mapped interface which provides our hardware mechanisms. Our industrial partner, Motorola, is implementing a similar network interface on-chip in an experimental version of the 88110 processor.

We introduce a new variant of tight closure associated to any fixed ideal a, which we call a-tight closure, and study various properties thereof. In our theory, the annihilator ideal τ(a) of all a-tight closure relations, which is a generalization of the test ideal in the usual tight closure

INTRODUCTION 1.1.1 Background Since the seminal study of Leland, Taqqu, Willinger and Wilson [41] which set the groundwork for considering self-similarity an important notion in the understanding of network traffic including the modeling and analysis of network performance, an explosion of work

The aim of this paper is to investigate symmetry properties of tight frames, with a view to constructing tight frames of orthogonal polynomials in several variables which share the symmetries of the weight function, and other similar applications. This is achieved by using representation theory

are decomposed into structural domains based on the recurrence of structural motifs; (iii) folds are defined as tight clusters of domains in fold space. The fold classification, domain definitions and test sets for sequence-structure alignment (threading) are accessible on the web at www