Fan-in

Known as: Fan in, Fanin 
Fan-in is the number of inputs a gate can handle. For instance the fan-in for the AND gate shown in the figure is 3. Physical logic gates with a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Aspect mining is a reverse engineering process that aims at finding crosscutting concerns in existing systems. This article… (More)
  • figure 2
  • figure 3
  • figure 4
  • table I
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Advances in data acquisition and sensor technologies are leading towards the development of “high fan-in” architectures: widely… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2005
2005
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The issues of code scattering and tangling, thus of achieving a better modularity for a system's concerns, are addressed by the… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A leakage-tolerant design technique for high fan-in dynamic logic circuits is presented. An NMOS transistor with gate and drain… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Recent developments suggest both plausible fabrication techniques and viable architectures for building sublithographic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
Several types of piezoelectric fans for cooling electronic devices were constructed and tested at 60 Hz, 110 V and 220 V… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
  • figure 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We show that the class of two layer neural networks with bounded fan in is e ciently learn able in a realistic extension to the… (More)
Is this relevant?
1992
1992
It is shown that an acyclic smoothing network (and hence counting network) with fan-outn cannot be constructed from balancers of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We use algebraic methods to get lower bounds for complexity of different functions based on constant depth unbounded fan-in… (More)
Is this relevant?