Solving constraint optimization problems is hard because it is not enough to find the best solution; an algorithm does not know a candidate is the best solution until it has proven that there are no better solutions. The proof can be long, compared to the time spent to find a good solution. In the cases where there are resource bounds, the proof of optimality may not be achievable and a tradeof...

1 Abstract— In this paper, we examine, through direct experimentation, the tradeoff between design quality and performance, in terms of optimized design area, and the design time required to achieve this desired level of optimization. It is accepted that the costs associated with executing a VLSI design project must be managed. This includes finding an appropriate (and profitable) balance betwe...

We describe how unknown lexical entries are processed in a unification-based framework with large-coverage grammars and how from their usage lexical entries are extracted. To keep the time and space usage during parsing within bounds, information from external sources like Part of Speech (PoS) taggers and morphological analysers is taken into account when information is constructed for unknown ...

Extending a result of Borodin, et. al. [l], we show that any branching program using linear queries " rhixi: c " to sort n numibers i ⌧pp l **,⌧n must satisfy the time-space tradeoff relation TS = n(n*) , The same relation is also shown to be true for branching programs that uses queries " min R = ? " where R is any subset of {xl,x2,...,xnj .

This article presents an analysis of the secure key broadcasting scheme proposed by Wu, Ruan, Lai and Tseng [11]. The study of the parameters of the system is based on a connection with a special type of symmetric equations over finite fields. We present two different attacks against the system, whose efficiency depends on the choice of the parameters. In particular, a time-memory tradeoff atta...

Network intrusion detection systems (NIDS) make extensive use of regular expressions as attack signatures. Internally, NIDS represent and operate these signatures using finite automata. Existing representations of finite automata present a well-known time-space tradeoff: Deterministic automata (DFAs) provide fast matching but are memory intensive, while non-deterministic automata (NFAs) are spa...

The knowledge embedded in an online data stream is likely to change over time due to the dynamic evolution of the stream. Consequently, in frequent episode mining over an online stream, frequent episodes should be adaptively extracted from recently generated stream segments instead of the whole stream. However, almost all existing frequent episode mining approaches find episodes frequently occu...

Every permutation of {1, 2, . . . , N} can be written as the product of two involutions. As a consequence, any permutation of the elements of an array can be performed in-place using simultaneous swaps in two rounds of swaps. In the case where the permutation is the k-way perfect shuffle we develop two methods for efficiently computing the pair of involutions that accomplishes these swaps. The ...