Information Architecture Institute

Known as: IAI 
The Information Architecture Institute (IA Institute or IAI) is a non-profit volunteer organization dedicated to advancing and promoting information… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2017
0102019772017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
For high-speed packet access, hybrid automatic repeat request (HARQ) and multiple-input multiple-output (MIMO) multiplexing are… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
2009
2009
In multiple-input multiple-output (MIMO) filter bank multicarrier modulation (FBMC) systems, the frequency selective transmission… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
An experiment is reported examining dual-process models of belief bias in syllogistic reasoning using a problem complexity… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2003
2003
Leaf area index (LAI) is an important structural characteristic of forest ecosystems which has been shown to be strongly related… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
1996
1996
Let A and B be down-sets in the grid [k]" = {0 . . . . . k 1}". Given the sizes of A and B, how small can A + B = {a + be[k… (More)
Is this relevant?
1993
1993
The problem of handling vagueness and uncertainty as two different kinds of partial ignorance has become a major issue in several… (More)
Is this relevant?
1992
1992
In 1973, E. Szemeredi proved a theorem which found numerous applications in extremal combinatorial problems--The Uniformity Lemma… (More)
Is this relevant?
1991
1991
A weighted directed graph G IS a triple (V, A . g) where (V. A) IS a directed graph and g is a n arbitrary real-valued function… (More)
  • figure 2
Is this relevant?
1991
1991
Improving Bruck's Completion-Theorem for nets, we show that a net of order k and degree k + 1 t5 can be extended to an affine… (More)
Is this relevant?
1990
1990
Given a directed graph G = (V, A), the mazimzlm acyclic subgraph problem is to find a subset A’ of the arcs such that G’ = (V,A… (More)
Is this relevant?