Skip to search formSkip to main contentSkip to account menu

Generalized selection

In relational algebra, a generalized selection is a unary operation written as where is a propositional formula that consists of atoms as allowed in… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
In this paper, we present performance analysis of a zero forcing (ZF)-precoded scheduling system for multi-user multiple input… 
2010
2010
  • S. Hegner
  • 2010
  • Corpus ID: 13404064
Although a database view embodies partial information about the state of the main schema, the state of the view schema is a… 
2008
2008
We introduce an adaptive generalized selection combining (A-GSC) receiver that can be efficiently applied in diversity rich… 
2005
2005
This paper introduces and analyzes a new adaptive minimum-estimation minimum-combining switched-combining based scheme that… 
2005
2005
  • Hong-Chuan Yang
  • 2005
  • Corpus ID: 46307094
Diversity combining techniques improve the performance of wireless communication systems at the cost of increased processing… 
Highly Cited
2004
Highly Cited
2004
The authors propose an efficient moment generating function (MGF)-based method to evaluate the performance of generalized… 
2003
2003
In this paper, we study the asymptotic performance of generalized selection combining (GSC) over different fading channels for… 
1980
1980
Selection in a set requires time linear in the size of the set when there are no a priori constraints on the total orders…