In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
Endre Boros, Konrad Borys, Vladimir Gurvich, G&aac...
Abstract-- In this paper, a downlink scenario in which a singleantenna base station communicates with K single antenna users, over a time-correlated fading channel, is considered. ...
Mehdi Ansari Sadrabadi, Alireza Bayesteh, Amir K. ...
Implementation of legal bilingualism in Hong Kong after 1997 has necessitated the production of voluminous and extensive court proceedings and judgments in both Chinese and Englis...
Benjamin K. Tsou, Tom B. Y. Lai, K. K. Sin, Lawren...
Automatic speech recognition by machine is one of the most efficient methods for man-machine communications. Because speech waveform is nonlinear and variant. Speech recognition r...
Hrudaya K. Tripathy, B. K. Tripathy, Pradip K. Das
Abstract—Pseudoexhaustive testing involves applying all possible input patterns to the individual output cones of a combinational circuit. Based on our new algebraic results, we ...
Rajagopalan Srinivasan, Sandeep K. Gupta, Melvin A...