Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Super key (keyboard button)

Known as: Super, Super key 
The Super key refers to several different keys throughout keyboard history. Originally the Super key was a modifier key on the Space-cadet keyboard… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
  • A. Brisson
  • IEEE SmartWorld, Ubiquitous Intelligence…
  • 2017
  • Corpus ID: 49538791
In this paper we examine the creation of Whitenoise super keys. A Whitenoise key is an exponential length key that can be used as… Expand
2011
2011
Introduction Designing database is an art process similar to building a house. Database designers always face the problems of… Expand
  • figure 2
  • figure 4
  • figure 5
  • figure 6
  • figure 7
2010
2010
  • M. Smith
  • International Conference on Multimedia Technology
  • 2010
  • Corpus ID: 1270604
Wireless mesh networks can significantly improve the transmission performance of multi-hop links by using network coding. Thus, a… Expand
  • figure 1
  • figure 2
  • figure 3
2010
2010
Wireless mesh networks can significantly improve the transmission performance of multi-hop links by using network coding. Thus, a… Expand
2006
2006
Class An abstract class is a class that has no objects, but it has attributes, functions, and subclasses which inherit from it… Expand
  • figure 1.1
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
2006
2006
Abstract—Synchronization of two identical chaotic systems which starts with different initial conditions, by sending a part of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2005
2005
This paper discusses cryptography based on the property of chaotic synchronization. Specifically, it is about Round III of such a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2004
2004
We see a temporal data warehouse as a set of temporal views defined in the past frag- ment of the temporal relational algebra… Expand
  • figure 1
1993
1993
We describe data structures that allow efficient updates of materialized classes derived from relationship of classes in object… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
1992
1992
Redundant network structures allow efficient retrievals. Procedures to design network structures that allow efficient retrievals… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5