Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,425,518 papers from all fields of science
Search
Sign In
Create Free Account
Sparse language
Known as:
Sparse (disambiguation)
, Sparse set
In computational complexity theory, a sparse language is a formal language (a set of strings) such that the complexity function, counting the number…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
Berman–Hartmanis conjecture
Co-NP-complete
Complexity class
Complexity function
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
An Efficient 3-D Ear Recognition System Employing Local and Holistic Features
Jindan Zhou
,
S. Cadavid
,
M. Abdel-Mottaleb
IEEE Transactions on Information Forensics and…
2012
Corpus ID: 8181261
We present a complete three-dimensional (3-D) ear recognition system combining local and holistic features in a computationally…
Expand
2011
2011
Diversity in ranking via resistive graph centers
Kumar Avinava Dubey
,
Soumen Chakrabarti
,
C. Bhattacharyya
Knowledge Discovery and Data Mining
2011
Corpus ID: 1581583
Users can rarely reveal their information need in full detail to a search engine within 1--2 words, so search engines need to…
Expand
2008
2008
Harmonic Deformation Model for Edge Based Template Matching
Andreas Hofhauser
,
C. Steger
,
Nassir Navab
International Conference on Computer Vision…
2008
Corpus ID: 10169346
The paper presents an approach to the detection of deformable objects in single images. To this end we propose a robust match…
Expand
2008
2008
Simple Model of Flickermeter Signal Chain for Deformed Modulating Signals
G. Wiczyński
IEEE Transactions on Power Delivery
2008
Corpus ID: 25715251
The flickermeter is an instrument designed to measure an obnoxiousness of a flicker. A flickermeter's signal chain is a mapping…
Expand
2005
2005
Fast 3D reconstruction for small autonomous robots
David L. Cardon
,
Wade S. Fife
,
James K. Archibald
,
Dah-Jye Lee
31st Annual Conference of IEEE Industrial…
2005
Corpus ID: 32754052
The reconstruction of the 3D structure of a static environment is a powerful capability applicable to robot navigation. We…
Expand
1996
1996
Automatic Selection of Reference Views for Image-Based Scene Representations
Václav Hlaváč
,
A. Leonardis
,
Tomáš Werner
European Conference on Computer Vision
1996
Corpus ID: 2533801
The problem addressed in this paper is related to displaying a real 3-D scene from any viewpoint. To display a scene, a…
Expand
1996
1996
On the Existence of Hard Sparse Sets under Weak Reductions
ReductionsJin-Yi Cai
,
A. Naik
Symposium on Theoretical Aspects of Computer…
1996
Corpus ID: 2932092
Recently a 1978 conjecture by Hartmanis was resolved by Cai and Sivakumar, following progress made by Ogihara. It was shown that…
Expand
Highly Cited
1988
Highly Cited
1988
On Sets Truth-Table Reducible to Sparse Sets
R. V. Book
,
K. Ko
SIAM journal on computing (Print)
1988
Corpus ID: 26715229
We study sets that are truth-table reducible to sparse sets in polynomial time. The principal results are as follows: (1) For…
Expand
1987
1987
A Parallel Computation Algorithm for Static State Estimation by Means of Matrix Inversion Lemma
H. Sasaki
,
K. Aoki
,
R. Yokoyama
IEEE Power Engineering Review
1987
Corpus ID: 2319772
This paper presents an effective parallel computation algorithm for the static state estimation of a power system. The proposed…
Expand
Highly Cited
1983
Highly Cited
1983
On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets
Y. Yesha
SIAM journal on computing (Print)
1983
Corpus ID: 36893080
Let $\Sigma $ be a finite alphabet. A set $S \subset \Sigma ^ * $ is called sparse if the number of members of S having length at…
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