Yaacov Yesha - Publications

Affiliations: 
University of Maryland, Baltimore County 
Area:
Computer Science

32 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2015 Wu Y, Bojanova I, Yesha Y. They know your weaknesses - Do you?: Reintroducing common weakness enumeration Crosstalk. 28: 44-50.  0.68
2015 Wu Y, Bojanova I, Yesha Y. They know your weaknesses - Do you?: Reintroducing common weakness enumeration Crosstalk. 28: 44-50.  0.68
2014 Zafar F, Yesha Y, Badano A. Computational observers and visualization methods for stereoscopic medical imaging. Optics Express. 22: 22246-67. PMID 25321697 DOI: 10.1364/OE.22.022246  0.68
2010 Grasso MA, Mokashi R, Dalvi D, Cardone A, Dima AA, Bhadriraju K, Plant AL, Brady M, Yesha Y. Image classification of vascular smooth muscle cells Ihi'10 - Proceedings of the 1st Acm International Health Informatics Symposium. 484-486. DOI: 10.1145/1882992.1883068  0.68
2010 Cary A, Yesha Y, Adjouadi M, Rishe N. Leveraging cloud computing in geodatabase management Proceedings - 2010 Ieee International Conference On Granular Computing, Grc 2010. 73-78. DOI: 10.1109/GrC.2010.163  0.68
2008 Halem M, Tilmes C, Yesha Y, Chapman D, Nguyen P. Providing gridded atmospheric radiance products and services from modis and airs instruments on nasa's aqua satellite International Geoscience and Remote Sensing Symposium (Igarss). 4. DOI: 10.1109/IGARSS.2008.4779673  0.68
2007 Younis M, Sardesai A, Yesha Y. Optimal dynamic transport selection for wireless portable devices Wireless Communications and Mobile Computing. 7: 9-21. DOI: 10.1002/wcm.296  0.68
2004 Okun V, Black PE, Yesha Y. Comparison of fault classes in specification-based testing Information and Software Technology. 46: 525-533. DOI: 10.1016/j.infsof.2003.10.003  0.68
2004 Megalooikonomou V, Yesha Y. Space efficient quantization for distributed estimation by a multi-sensor fusion system Information Fusion. 5: 299-308. DOI: 10.1016/j.inffus.2003.11.002  0.68
2002 Megalooikonomou V, Yesha Y. Quantization for distributed estimation using neural networks Information Sciences. 148: 185-199. DOI: 10.1016/S0020-0255(02)00294-3  0.68
2000 Black PE, Okun V, Yesha Y. Mutation operators for specifications Proceedings Ase 2000: 15th Ieee International Conference On Automated Software Engineering. 81-88. DOI: 10.1109/ASE.2000.873653  0.68
2000 Megalooikonomou V, Yesha Y. Quantizer design for distributed estimation with communication constraints and unknown observation statistics Ieee Transactions On Communications. 48: 181-184. DOI: 10.1109/26.823548  0.68
1999 Kalpakis K, Yesha Y. Upper and lower bounds on the makespan of schedules for tree dags on linear arrays Algorithmica (New York). 23: 159-179.  0.68
1998 Yesha Y. Parameter replacement for CELP coded speech in land mobile radio Wireless Networks. 4: 291-295.  0.68
1997 Kalpakis K, Yesha Y. On the Bisection Width of the Transposition Network Networks. 29: 69-76.  0.68
1996 Kalpakis K, Yesha Y. Scheduling Tree dags on Parallel Architectures Algorithmica (New York). 15: 373-396.  0.68
1995 Yesha Y. On the power of the linear array architecture for performing tree-structured computations Journal of Computer and System Sciences. 50: 1-10.  0.68
1991 Chen L, Yesha Y. Parallel recognition of the consecutive ones property with applications Journal of Algorithms. 12: 375-392. DOI: 10.1016/0196-6774(91)90010-V  0.68
1991 Li M, Yesha Y. Resource bounds for parallel computation of threshold and symmetric functions Journal of Computer and System Sciences. 42: 119-137. DOI: 10.1016/0022-0000(91)90042-4  0.68
1990 He X, Yesha Y. Efficient parallel algorithms for r-dominating set and p-center problems on trees Algorithmica. 5: 129-145. DOI: 10.1007/BF01840381  0.68
1989 Li M, Yesha Y. New Lower Bounds for Parallel Computation Journal of the Acm (Jacm). 36: 671-680. DOI: 10.1145/65950.65959  0.68
1989 Fich FE, Li M, Ragde P, Yesha Y. On the power of concurrent-write PRAMs with read-only memory Information and Computation. 83: 234-244. DOI: 10.1016/0890-5401(89)90059-X  0.68
1988 He X, Yesha Y. Binary tree algebraic computation and parallel algorithms for simple graphs Journal of Algorithms. 9: 92-113. DOI: 10.1016/0196-6774(88)90007-7  0.68
1987 He X, Yesha Y. Parallel recognition and decomposition of two terminal series parallel graphs Information and Computation. 75: 15-38. DOI: 10.1016/0890-5401(87)90061-7  0.68
1987 Li M, Yesha Y. Separation and lower bounds for ROM and nondeterministic models of parallel computation Information and Computation. 73: 102-128. DOI: 10.1016/0890-5401(87)90017-4  0.68
1986 Fraenkel AS, Yesha Y. The generalized Sprague-Grundy function and its invariance under certain mappings Journal of Combinatorial Theory, Series A. 43: 165-177. DOI: 10.1016/0097-3165(86)90058-0  0.68
1986 Li M, Yesha Y. String-matching cannot be done by a two-head one-way deterministic finite automation Information Processing Letters. 22: 231-235. DOI: 10.1016/0020-0190(86)90099-2  0.68
1984 Hartmanis J, Yesha Y. Computation times of NP sets of different densities Theoretical Computer Science. 34: 17-32. DOI: 10.1016/0304-3975(84)90111-7  0.68
1984 Yesha Y. Time-space tradeoffs for matrix multiplication and the discrete fourier transform on any general sequential random-access computer Journal of Computer and System Sciences. 29: 183-197. DOI: 10.1016/0022-0000(84)90029-1  0.68
1982 Fraenkel AS, Yesha Y. Theory of annihilation games-I Journal of Combinatorial Theory, Series B. 33: 60-86. DOI: 10.1016/0095-8956(82)90058-2  0.68
1979 Fraenkel AS, Yesha Y. Complexity of problems in games, graphs and algebraic equations Discrete Applied Mathematics. 1: 15-30. DOI: 10.1016/0166-218X(79)90012-X  0.68
1976 Fraenkel AS, Yesha Y. Theory of annihilation games Bulletin of the American Mathematical Society. 82: 775-777. DOI: 10.1090/S0002-9904-1976-14160-2  0.68
Show low-probability matches.