Sciweavers

2194 search results - page 84 / 439
» Improving HLRTA*( k )
Sort
View
96
Voted
DM
2008
96views more  DM 2008»
15 years 1 months ago
Generating 3-vertex connected spanning subgraphs
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...
119
Voted
CORR
2006
Springer
108views Education» more  CORR 2006»
15 years 1 months ago
Scheduling and Codeword Length Optimization in Time Varying Wireless Networks
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. ...
100
Voted
IJCPOL
2006
106views more  IJCPOL 2006»
15 years 1 months ago
Court Stenography-to-Text ("stt") in Hong Kong: a Jurilinguistic Engineering Effort
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...
111
Voted
JCIT
2008
124views more  JCIT 2008»
15 years 1 months ago
A Knowledge based Approach Using Fuzzy Inference Rules for Vowel Recognition
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
76
Voted
TVLSI
1998
95views more  TVLSI 1998»
15 years 1 months ago
Bounds on pseudoexhaustive test lengths
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...