JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing by Author "Bilardi, Gianfranco"
Now showing items 712 of 12

Inductive Inference without Overgeneralization from Positive Examples
Kapur, Shyam; Bilardi, Gianfranco (Cornell University, 198911)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 is studied when the learner ... 
Language Learning without Overgeneralization
Kapur, Shyam; Bilardi, Gianfranco (Cornell University, 199011)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, 198703)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, 199609)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 ... 
SizeTime Complexity of Boolean Networks for Prefix Computations
Bilardi, Gianfranco; Preparata, Franco P. (Cornell University, 198701)The prefix problem consists of computing all the products $x_{0}x_{1}\ldots x_{j} (j=0,\ldots,N1)$, given a sequence $X = (x_{0},x_{1},\ldots,x_{N1})$ of elements in a semigroup. In this paper we completely characterize ... 
Time Lower Bounds for CREWPRAM Computation of Monotone Functions
Bilardi, Gianfranco; Moitra, Abha (Cornell University, 198905)It is shown that the time to compute a monotone boolean function depending upon $n$ variables on a CREWPRAM satisfies the lower bound $T = \Omega$(log $l$ + (log $n$)/$l$), where $l$ is the size of the largest prime ...