Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,389,628 papers from all fields of science
Search
Sign In
Create Free Account
Superincreasing sequence
Known as:
Super increasing sequence
, Super-increasing sequence
In mathematics, a sequence of positive real numbers is called superincreasing if every element of the sequence is greater than the sum of all…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Broader (1)
Cryptography
Merkle–Hellman knapsack cryptosystem
Python
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
An Efficient and Privacy-Preserving Disease Risk Prediction Scheme for E-Healthcare
Xue Yang
,
Rongxing Lu
,
Jun Shao
,
Xiaohu Tang
,
Haomiao Yang
IEEE Internet of Things Journal
2019
Corpus ID: 70235440
Big data mining-driven disease risk prediction has become one of the important topics in the field of e-healthcare. However…
Expand
2019
2019
Traffic Monitoring in Self-Organizing VANETs: A Privacy-Preserving Mechanism for Speed Collection and Analysis
Liehuang Zhu
,
Chuan Zhang
,
Chang Xu
,
Xiaojiang Du
,
Nadra Guizani
,
K. Sharif
IEEE wireless communications
2019
Corpus ID: 209458777
With the explosive growth of vehicles, traffic monitoring has garnered significant attention in recent years. Collecting…
Expand
2015
2015
Convex hulls of superincreasing knapsacks and lexicographic orderings
A. Gupte
Discrete Applied Mathematics
2015
Corpus ID: 14413370
2013
2013
Cryptanalysis and Improvement of Akleylek et al.'s cryptosystem
Roohallah Rastaghi
IACR Cryptology ePrint Archive
2013
Corpus ID: 7749840
Akleylek et al. [S. Akleylek, L. Emmungil and U. Nuriyev, A mod ified algorithm for peer-to-peer security, journal of Appl…
Expand
2012
2012
Forbidding extreme points from the 0 − 1 hypercube
Gustavo Angulo
,
Shabbir Ahmed
2012
Corpus ID: 12539643
Let B be the set of n-dimensional binary vectors and let V be a subset of m of its elements. We give an extended formulation of…
Expand
2011
2011
RSA algorithm using modified subset sum cryptosystem
Sonal Sharma
,
Prashant Sharma
,
R. Dhakar
International Conference on Computing and…
2011
Corpus ID: 2016799
RSA is the asymmetric cryptography system. The security of RSA public key cryptosystem is based on the assumption that factoring…
Expand
2007
2007
On the Weakly Superincreasing Distributions and the Fibonacci-Hessenberg Matrices
M. Esmaeili
Ars Comb.
2007
Corpus ID: 13332742
Highly Cited
2006
Highly Cited
2006
Wireless Link Scheduling With Power Control and SINR Constraints
S. Borbash
,
A. Ephremides
IEEE Transactions on Information Theory
2006
Corpus ID: 8700669
The problem of determining a minimal length schedule to satisfy given link demands in a wireless network is considered. Links are…
Expand
Highly Cited
2004
Highly Cited
2004
Spam filtering using a Markov random field model with variable weighting schemas
Shalendra Chhabra
,
W. Yerazunis
,
Christian Siefkes
Industrial Conference on Data Mining
2004
Corpus ID: 14277498
In this paper we present a Markov random field model based approach to filter spam. Our approach examines the importance of the…
Expand
1989
1989
A more efficient public-key cryptosystem using the Pascal triangle
R. Cooper
,
R. Hunter-Duvar
,
W. Patterson
IEEE International Conference on Communications…
1989
Corpus ID: 62166297
The authors propose a public-key cryptosystem that uses a knapsack model based on the structure of a Pascal triangle or a super…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE