5 Result(s)
within
Chapter
ZhiZhong **g
English
Algorithm Analysis and Problem Complexity
Computer Communication Networks
Theory of Computation
-
Chapter and Conference Paper
Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats
Tandem repeated regions are closely related to some genetic diseases in human beings. Once a region containing pseudo-periodic repeats is found, it is interesting to study the history of creating the repeats. ...
-
Chapter and Conference Paper
A Scalable Mechanism for Semantic Service Discovery in Multi-ontology Environment
Semantic service discovery improves the performance of service matching, due to using ontology and logical reasoning. However, in open distributed computing environment available mechanisms for semantic servic...
-
Chapter and Conference Paper
A Static Data Dependence Analysis Approach for Software Pipelining
This paper introduces a new static data dependence constraint, called dependence difference inequality, which can deal with coupled subscripts for multi-dimensional array references. Unlike direction vectors, ...
-
Chapter and Conference Paper
Co** with Data Dependencies of Multi-dimensional Array References
This paper presents a new static data dependence analysis approach, Dependence Difference Inequality Test, which can deal with coupled subscripts for multi-dimensional array references for software pipelining ...
-
Chapter and Conference Paper
A Dynamic Data Dependence Analysis Approach for Software Pipelining
This paper presents a run-time pointer aliasing disambiguation method for software pipelining techniques. By combining hardware with software, the method is better than run-time checking method or run-time com...
