AllJoyn

Known as: All join, AllSeen Alliance, Alljoin 
AllJoyn was a collaborative open source software framework that allows devices to communicate with other devices around them. AllJoyn framework is… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1994-2016
051019942016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Interoperability between smart devices and applications across multiple architectures, platforms and communication technologies… (More)
  • table I
  • table II
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
2014
2014
The increasing number of everyday embedded devices that are interconnected over the Internet leads to the need of new software… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
In most decision models dealing with unobservable stochastic congested environments, one looks for a (Nash) equilibrium behavior… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The woollen coat, for example, which covers the day-labourer, as coarse and rough as it may appear, is the produce of the joint… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2004
2004
Outerjoins are an important class of joins and are widely used in various kinds of applications. It is challenging to optimize… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
Spatial data mining requires the analysis of the interactions in space. These interactions can be materialized using distance… (More)
  • figure 1
  • figure 2
  • table I
  • figure 4
  • figure 5
Is this relevant?
2002
2002
For a partially ordered set P , we denote by Co(P ) the lattice of order-convex subsets of P . We find three new lattice… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
The intent of Aspect-Oriented Programming is to encapsulate, reuse, and maintain concerns that crosscut modularization constructs… (More)
  • figure 1
  • figure 2
Is this relevant?
2001
2001
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a… (More)
  • figure 1
  • figure 2
Is this relevant?
1999
1999
Let L be a finite distributive lattice, and let J(L) denote the set of all join-irreducible elements of L. Set j (L) = IJ(Z)l… (More)
Is this relevant?