Skip to search form
Skip to main content
>
Semantic Scholar
Semantic Scholar's Logo
Search
Sign In
Create Free Account
You are currently offline. Some features of the site may not work correctly.
LP-type problem
In the study of algorithms, an LP-type problem (also called a generalized linear program) is an optimization problem that shares certain properties…
Expand
Wikipedia
Create Alert
Related topics
Related topics
32 relations
1-center problem
Algorithm
Algorithmic game theory
Algorithmica
Expand
Broader (2)
Computational geometry
Linear programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Low-Power Wide Area Network Technologies for Internet-of-Things: A Comparative Review
Augustine Ikpehai
,
B. Adebisi
,
+5 authors
U. Mbanaso
IEEE Internet of Things Journal
2019
Corpus ID: 69444615
The rapid growth of Internet-of-Things (IoT) in the current decade has led to the development of a multitude of new access…
Expand
Highly Cited
2009
Highly Cited
2009
A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
G. H. Mohimani
,
M. Babaie-Zadeh
,
C. Jutten
IEEE Transactions on Signal Processing
2009
Corpus ID: 10894984
In this paper, a fast algorithm for overcomplete sparse decomposition, called SL0, is proposed. The algorithm is essentially a…
Expand
Highly Cited
2009
Highly Cited
2009
Collective annotation of Wikipedia entities in web text
Sayali Kulkarni
,
A. Singh
,
Ganesh Ramakrishnan
,
Soumen Chakrabarti
KDD
2009
Corpus ID: 1632184
To take the first step beyond keyword-based search toward entity-based search, suitable token spans ("spots") on documents must…
Expand
Highly Cited
2009
Highly Cited
2009
Mining Individual Life Pattern Based on Location History
Y. Ye
,
Y. Zheng
,
Yukun Chen
,
Jianhua Feng
,
X. Xie
Tenth International Conference on Mobile Data…
2009
Corpus ID: 9966450
The increasing pervasiveness of location-acquisition technologies (GPS, GSM networks, etc.) enables people to conveniently log…
Expand
Highly Cited
2008
Highly Cited
2008
Tightening LP Relaxations for MAP using Message Passing
D. Sontag
,
Talya Meltzer
,
A. Globerson
,
T. Jaakkola
,
Yair Weiss
UAI
2008
Corpus ID: 14429740
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical…
Expand
Highly Cited
2005
Highly Cited
2005
Subsidies, hierarchy and peers: the awkward economics of higher education
Gordon Vinston
2005
Corpus ID: 775885
H igher education is a business: it produces and sells educational services to customers for a price and it buys inputs with…
Expand
Highly Cited
2005
Highly Cited
2005
MAP estimation via agreement on trees: message-passing and linear programming
M. Wainwright
,
T. Jaakkola
,
A. Willsky
IEEE Transactions on Information Theory
2005
Corpus ID: 10007532
We develop and analyze methods for computing provably optimal maximum a posteriori probability (MAP) configurations for a…
Expand
Highly Cited
2004
Highly Cited
2004
On The Marriage of Lp-norms and Edit Distance
Lei Chen
,
R. Ng
VLDB
2004
Corpus ID: 7475159
Existing studies on time series are based on two categories of distance functions. The first category consists of the Lp-norms…
Expand
Highly Cited
1995
Highly Cited
1995
Mice deficient in IL-1β-converting enzyme are defective in production of mature IL-1β and resistant to endotoxic shock
P. Li
,
H. Allen
,
+14 authors
Tara Seshadri
Cell
1995
Corpus ID: 18756273
Abstract IL-1β-converting enzyme (ICE) cleaves pro-1L-1β to generate mature IL-1β. ICE is homologous to other proteins that have…
Expand
Highly Cited
1966
Highly Cited
1966
Real and complex analysis
W. Rudin
1966
Corpus ID: 119027153
Preface Prologue: The Exponential Function Chapter 1: Abstract Integration Set-theoretic notations and terminology The concept of…
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