Various cyclic structures have been employed in cryptography and in pseudrandom number generation. One of the most basic arenas for this study is the multiplicative group of integers modulo n.
We present an algorithm that generates all maximal independent sets of a graph in lexicographic order, with only polynomial delay between the output of two successive independent sets.
We consider the efficient generation of hard instances of NP problems with known solutions.
WiFi channel state information (CSI) has emerged as a plausible modality for sensing different human vital signs, i.e., respiration and body motion, as a function of modulated wireless signals that
Given a fixed graph H on t vertices, a typical graph G on n vertices contains many induced subgraphs isomorphic to H as n becomes large.
A strong reason for the success of the full-scan design is that it allows the use of combinational ATPG.
In this paper, we propose a hybrid approach to switch scheduling. Traffic with tight jitter constraints is first scheduled using a frame-based scheduler that achieves low jitter bounds.
Input-queued switches are used extensively in the design of high-speed routers.
Input-queued switches are used extensively in the design of high-speed routers.
Software applications are inevitably concerned with data integrity, whether the data is stored in a database, files, or program memory.
