Journal of Computer and System Sciences

Known as: JCSS 
The Journal of Computer and System Sciences (JCSS) is a peer-reviewed scientific journal in the field of computer science. JCSS is published by… (More)
Wikipedia

Related topics

Related topics

36 relations
ACC0Aanderaa–Karp–Rosenberg conjectureApex graphBeap
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Query expansion for hash-based image object retrieval
An efficient indexing method is essential for content-based image retrieval with the exponential growth in large-scale videos and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Keep a Few: Outsourcing Data While Maintaining Confidentiality
We put forward a novel paradigm for preserving privacy in data outsourcing which departs from encryption. The basic idea behind… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies
This paper presents three results on the power of two-prover one-round interactive proof systems based on oracularization under… (More)
Is this relevant?
2008
2008
Dual-band antenna design using an EBG Artificial Magnetic Conductor ground plane
This work studies dual-band EBG structures used as an artificial magnetic conductor (AMC) ground plane for WLAN co-planar antenna… (More)
Is this relevant?
2007
2007
Solving Numerical NP-Complete Problems with Spiking Neural P Systems
Starting from an extended nondeterministic spiking neural P system that solves the Subset Sum problem in a constant number of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Unsupervised Models for Named Entity Classification
This paper discusses the use of unlabeled examples for the problem of named entity classification. A large number of rules is… (More)
  • table 1
  • table 2
  • figure 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Deniable Encryption
Consider a situation in which the transmission of an encrypted message can be intercepted by an authority, and subsequently (say… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
A practical scheme for non-interactive verifiable secret sharing
  • Paul Feldman
  • 28th Annual Symposium on Foundations of Computer…
  • 1987
This paper presents an extremely efficient, non-interactive protocol for verifiable secret sharing. Verifiable secret sharing… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
The choice coordination problem
In the course of a concurrent computation, processes P1,..., Pn must reach a common choice of one out of k alternatives A 1… (More)
Is this relevant?