Now showing items 8-12 of 12

    • Language Learning without Overgeneralization 

      Kapur, Shyam; Bilardi, Gianfranco (Cornell University, 1990-11)
      Language learnability is investigated in the Gold paradigm of inductive inference from positive data. Angluin gave a characterization of learnable families in this framework. Here, learnability of families of recursive ...
    • Merging and Sorting Networks with the Topology of the Omega Network 

      Bilardi, Gianfranco (Cornell University, 1987-03)
      We consider a class of comparator networks obtained from the omega permutation network by replacing each switch with a comparator exchanger of arbitrary direction. These networks are all isomorphic to each other, have ...
    • Optimal Control Dependence Computation and the Roman Chariots Problem 

      Pingali, Keshav; Bilardi, Gianfranco (Cornell University, 1996-09)
      The control dependence relation plays a fundamental role in program restructuring and optimization. The usual representation of this relation is the control dependence graph (CDG), but the size of the CDG can grow ...
    • Size-Time Complexity of Boolean Networks for Prefix Computations 

      Bilardi, Gianfranco; Preparata, Franco P. (Cornell University, 1987-01)
      The prefix problem consists of computing all the products $x_{0}x_{1}\ldots x_{j} (j=0,\ldots,N-1)$, given a sequence $X = (x_{0},x_{1},\ldots,x_{N-1})$ of elements in a semigroup. In this paper we completely characterize ...
    • Time Lower Bounds for CREW-PRAM Computation of Monotone Functions 

      Bilardi, Gianfranco; Moitra, Abha (Cornell University, 1989-05)
      It is shown that the time to compute a monotone boolean function depending upon $n$ variables on a CREW-PRAM satisfies the lower bound $T = \Omega$(log $l$ + (log $n$)/$l$), where $l$ is the size of the largest prime ...