Computing communities in large networks using random walks.
Computing complexity distances between algorithms
We introduce a new (extended) quasi-metric on the so-called dual p-complexity space, which is suitable to give a quantitative measure of the improvement in complexity obtained when a complexity function is replaced by a more efficient complexity function on all inputs, and show that this distance function has the advantage of possessing rich topological and quasi-metric properties. In particular, its induced topology is Hausdorff and completely regular. Our approach is applied to the measurement...
Computing Convolutions by Reciprocal Search.
Computing evolutionary chains in musical sequences.
Computing grammars and context-sensitive languages
Computing Gröbner fans of toric ideals.
Computing guided modes for an unbounded stratified medium in integrated optics
We present a finite element method to compute guided modes in a stratified medium. The major difficulty to overcome is related to the unboundedness of the stratified medium. Our method is an alternative to the use of artificial boundary conditions and to the use of integral representation formulae. The domain is bounded in such a way we can write the solution on its lateral boundaries in terms of Fourier series. The series is then truncated for the computations over the bounded domain. The problem...
Computing guided modes for an unbounded stratified medium in integrated optics
We present a finite element method to compute guided modes in a stratified medium. The major difficulty to overcome is related to the unboundedness of the stratified medium. Our method is an alternative to the use of artificial boundary conditions and to the use of integral representation formulae. The domain is bounded in such a way we can write the solution on its lateral boundaries in terms of Fourier series. The series is then truncated for the computations over the bounded domain. The problem...
Computing Kazhdan-Lusztig polynomials for arbitrary Coxeter groups.
Computing multiple-valued logic programs.
The logic of signed formula can be used to reason about a wide variety of multiple-valued logics [Häh94b, LMR97]. The formal theoretical foundation of multiple-valued logic programming based on signed formulas is set forth in [Lu96]. The current paper is an investigation into the operational semantics of such signed logic programming. The connection of signed logic programming to constraint logic programming is presented, search space issues are briefly discussed for both general and special cases,...
Computing nilpotent quotients in finitely presented Lie rings.
Computing of graphs of relations using generative grammars
Computing parametric rational generating functions with a primal Barvinok algorithm.
Computing radial drawings on the minimum number of circles.
Computing Simple Circuits from a Set of Line Segments.
Computing Strong Metric Dimension of some Special Classes of Graphs by Genetic Algorithms
Computing the dimension of a semi-algebraic set.
Computing the discrete compactness of orthogonal pseudo-polytopes via their D-EVM representation.
Computing the Ehrhart Polynomial of a Convex Lattice Polytope.
Computing the Geodesic Center of a Simple Polygon.