Yaacov Yesha

According to our database1, Yaacov Yesha authored at least 54 papers between 1978 and 2018.

Collaborative distances:



In proceedings 
PhD thesis 



On csauthors.net:


Randomness Classes in Bugs Framework (BF): True-Random Number Bugs (TRN) and Pseudo-Random Number Bugs (PRN).
Proceedings of the 2018 IEEE 42nd Annual Computer Software and Applications Conference, 2018

The Bugs Framework (BF): A Structured Approach to Express Bugs.
Proceedings of the 2016 IEEE International Conference on Software Quality, 2016

YinMem: A distributed parallel indexed in-memory computation system for large scale data analytics.
Proceedings of the 2016 IEEE International Conference on Big Data, 2016

Integrating domain knowledge in supervised machine learning to assess the risk of breast cancer.
IJMEI, 2014

Personalized Decision Support System to Enhance Evidence Based Medicine through Big Data Analytics.
Proceedings of the 2014 IEEE International Conference on Healthcare Informatics, 2014

Personal Web in Healthcare.
Proceedings of the Handbook of Medical and Healthcare Technologies, 2013

A policy-based cloud broker for the VCL platform.
IJCC, 2013

SksOpen: Efficient Indexing, Querying, and Visualization of Geo-spatial Big Data.
Proceedings of the 12th International Conference on Machine Learning and Applications, 2013

A Methodology for Ontology Evaluation Using Topic Models.
Proceedings of the 2012 Fourth International Conference on Intelligent Networking and Collaborative Systems, 2012

Sub-cellular feature detection and automated extraction of collocalized actin and myosin regions.
Proceedings of the ACM International Health Informatics Symposium, 2012

Image classification of vascular smooth muscle cells.
Proceedings of the ACM International Health Informatics Symposium, 2010

Leveraging Cloud Computing in Geodatabase Management.
Proceedings of the 2010 IEEE International Conference on Granular Computing, 2010

User-Centric Smart Services in the Cloud.
Proceedings of the Smart Internet - Current Research and Future Applications, 2010

Scientific Services on the Cloud.
Proceedings of the Handbook of Cloud Computing., 2010

Second Space: A Generative Model for the Blogosphere.
Proceedings of the Second International Conference on Weblogs and Social Media, 2008

Optimal dynamic transport selection for wireless portable devices.
Wireless Communications and Mobile Computing, 2007

Modeling contention of sparse-matrix-vector multiplication (SMV) in three parallel programming paradigms.
Proceedings of the 6th International Workshop on Software and Performance, 2007

On the Structure, Properties and Utility of Internal Corporate Blogs.
Proceedings of the First International Conference on Weblogs and Social Media, 2007

A framework for specification and performance evaluation of service discovery protocols in mobile ad-hoc networks.
Ad Hoc Networks, 2006

Comparison of fault classes in specification-based testing.
Information & Software Technology, 2004

Space efficient quantization for distributed estimation by a multi-sensor fusion system.
Information Fusion, 2004

Quantization for distributed estimation using neural networks.
Inf. Sci., 2002

Quantizer design for distributed estimation with communication constraints and unknown observation statistics.
IEEE Trans. Communications, 2000

Mutation Operators for Specifications.
Proceedings of the Fifteenth IEEE International Conference on Automated Software Engineering, 2000

Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays.
Algorithmica, 1999

Parameter replacement for CELP coded speech in land mobile radio.
Wireless Networks, 1998

Design of neural network quantizers for a distributed estimation system with communication constraints.
Proceedings of the 1998 IEEE International Conference on Acoustics, 1998

On the bisection width of the transposition network.
Networks, 1997

On the Power of the Linear Array Architecture for Performing Tree-Structured Computations.
J. Comput. Syst. Sci., 1995

Efficient parallel algorithms for bipartite permutation graphs.
Networks, 1993

A Scheduling Principle for Precedence Graphs with Communication Delay.
Proceedings of the 1992 International Conference on Parallel Processing, 1992

Resource Bounds for Parallel Computation of Threshold and Symmetric Functions.
J. Comput. Syst. Sci., 1991

Parallel Recognition of the Consecutive Ones Property with Applications.
J. Algorithms, 1991

Mapping Task Trees onto a Linear Array.
Proceedings of the International Conference on Parallel Processing, 1991

Efficient Parallel Algorithms for r-Dominating Set and p-Center Problems on Trees.
Algorithmica, 1990

On the Power of Concurrent-Write PRAMs With Read-Only Memory
Inf. Comput., November, 1989

New lower bounds for parallel computation.
J. ACM, 1989

A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs.
SIAM J. Comput., 1988

Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs.
J. Algorithms, 1988

Parallel Recognitions and Decomposition of Two Terminal Series Parallel Graphs
Inf. Comput., October, 1987

Separation and Lower Bounds for ROM and Nondeterministic Models of Parallel Computation
Inf. Comput., May, 1987

The Probabilistic and Deterministic Parallel Complexity of Symmetric Functions.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

The generalized Sprague-Grundy function and its invariance under certain mappings.
J. Comb. Theory, Ser. A, 1986

String-Matching Cannot be Done by a Two-Head One-Way Deterministic Finite Automation.
Inf. Process. Lett., 1986

New Lower Bounds for Parallel Computation
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Containment, Separation, Complete Sets, and Immunity of Complexity Classes.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

Computation Times of NP Sets of Different Densities.
Theor. Comput. Sci., 1984

Time-Space Tradeoffs for Matrix Multiplication and the Discrete Fourier Transform on any General Sequential Random-Access Computer.
J. Comput. Syst. Sci., 1984

On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets.
SIAM J. Comput., 1983

Computation Times of NP Sets of Different Densities.
Proceedings of the Automata, 1983

Mean flow scheduling and optimal construction of a treelike communication network.
Networks, 1981

Complexity of Solving Algebraic Equations.
Inf. Process. Lett., 1980

Complexity of problems in games, graphs and algebraic equations.
Discrete Applied Mathematics, 1979

The Complexity of Checkers on an N * N Board - Preliminary Report
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978