We revisit the longest common extension (LCE) problem, that is, preprocess a string T into a compact data structure that supports fast LCE queries. An LCE query takes a pair (i, j) of indices in T and returns the length of the longest common prefix of the suffixes of T starting at positions i and j. We study the time-space trade-offs for the problem, that is, the space used for the data structu...

In the training of neural networks, there often exists a tradeoff between the time spent optimizing the model under investigation, and its final performance. Ideally, an optimization algorithm finds the model that has best test accuracy from the hypothesis space as fast as possible, and this model is efficient to evaluate at test time as well. However, in practice, there exists a trade-off betw...

A set of anonymous processors is interconnected forming a complete synchronous network with sense of direction. Weak unison is the problem where all processors want to enter the same state (in our case “wakeup” state) in the absence of a global start-up signal. As measure of complexity of the protocols considered we use the “bits” times “lag” measure, i.e. the total number of (wakeup) messages ...

Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen a revival of interest in pebble games coming from the field of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof systems when comparing the strength of different subsystems, showing bounds on proof space, and establishing size-space...

Increasingly shorter product life cycles impel rms to design, develop, and market more products in less time than ever before. Overlapping of design and development stages is commonly regarded as the most promising strategy to reduce product development times. However, overlapping typically requires additional resources and can be costly. Our research addresses the trade-o) between product deve...

Impulsivity has been defined as choosing the smaller more immediate reward over a larger more delayed reward. The purpose of this research was to gain a deeper understanding of the mental processes involved in the decision making. We examined participants' rates of delay discounting and probability discounting to determine their correlation with time-probability trade-offs. To establish the tim...

After a brief overview of optical resonant filter technology, and three-dimensional waveguide technology, which are key candidates for optical memory, this report discusses potential applications in detail, with a clear indication of the trade-offs involved. We assume that in order to find practical applications, optical memory must be organised into delay-lines. Otherwise, for example, if opti...

Residual vector quantization (RVQ), tree-structured RVQ (TRVQ), and full-search tree-structured RVQ (FSTRVQ) are presented as techniques which exploit the benefit of vector quantization (VQ), while maintaining manageable memory and computational complexity. RVQ provides linear growth in memory and computational complexity with basic codebook size, compared to the exponential growth of full sear...

The Data-Intensive Architecture (DIVA) system incorporates Processing-In-Memory (PIM) chips as smart-memory coprocessors to a microprocessor. This architecture exploits inherent memory bandwidth both on chip and across the system. Thus, performances of pointer-based and sparse-matrix computations as well as multimedia applications are significantly enhanced. A key feature of the DIVA architectu...