Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,733,737 papers from all fields of science
Search
Sign In
Create Free Account
Maximal set
Known as:
Maximal
, Maximal sets
In recursion theory, the mathematical theory of computability, a maximal set is a coinfinite recursively enumerable subset A of the natural numbers…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
4 relations
Anaphora (linguistics)
Recursively enumerable set
Simple set
Broader (1)
Computability theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Maximal Vector Computation in Large Data Sets
P. Godfrey
,
R. Shipley
,
Jarek Gryz
VLDB
2005
Corpus ID: 3405818
Finding the maximals in a collection of vectors is relevant to many applications. The maximal set is related to the convex hull…
Expand
Highly Cited
2004
Highly Cited
2004
Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope
A. Oliva
,
A. Torralba
International Journal of Computer Vision
2004
Corpus ID: 11664336
In this paper, we propose a computational model of the recognition of real world scenes that bypasses the segmentation and the…
Expand
Highly Cited
2003
Highly Cited
2003
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
Lizhong Zheng
,
David Tse
IEEE Trans. Inf. Theory
2003
Corpus ID: 10129427
Multiple antennas can be used for increasing the amount of diversity or the number of degrees of freedom in wireless…
Expand
Highly Cited
2001
Highly Cited
2001
Efficiently mining maximal frequent itemsets
K. Gouda
,
Mohammed J. Zaki
Proceedings IEEE International Conference on…
2001
Corpus ID: 10584899
We present GenMax, a backtracking search based algorithm for mining maximal frequent itemsets. GenMax uses a number of…
Expand
Highly Cited
1998
Highly Cited
1998
A simple transmit diversity technique for wireless communications
S. Alamouti
IEEE J. Sel. Areas Commun.
1998
Corpus ID: 3236236
This paper presents a simple two-branch transmit diversity scheme. Using two transmit antennas and one receive antenna the scheme…
Expand
Highly Cited
1988
Highly Cited
1988
On Generating All Maximal Independent Sets
David S. Johnson
,
C. Papadimitriou
,
M. Yannakakis
Inf. Process. Lett.
1988
Corpus ID: 16194229
Highly Cited
1986
Highly Cited
1986
A Simple Parallel Algorithm for the Maximal Independent Set Problem
M. Luby
SIAM J. Comput.
1986
Corpus ID: 23987873
Two basic design strategies are used to develop a very simple and fast parallel algorithms for the maximal independent set (MIS…
Expand
Highly Cited
1985
Highly Cited
1985
A simple parallel algorithm for the maximal independent set problem
M. Luby
STOC '85
1985
Corpus ID: 1126858
Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo…
Expand
Highly Cited
1977
Highly Cited
1977
A New Algorithm for Generating All the Maximal Independent Sets
S. Tsukiyama
,
Mikio Ide
,
H. Ariyoshi
,
I. Shirakawa
SIAM J. Comput.
1977
Corpus ID: 33090588
The problem of generating all the maximal independent sets (or maximal cliques) of a given graph is fundamental in graph theory…
Expand
Highly Cited
1974
Highly Cited
1974
THE MAXIMAL COVERING LOCATION PROBLEM
R. Church
,
C. R. Velle
1974
Corpus ID: 154435809
The belief that mathematical location modeling can identify "optimal" location patterns rests on the basis that some realistic…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE