Linear search

Known as: Sequential search 
In computer science, linear search or sequential search is a method for finding a target value within a list. It sequentially checks each element of… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Due to the increasing popularity of cloud computing, more and more data owners are motivated to outsource their data to cloud… (More)
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Searchable (symmetric) encryption allows encryption while still enabling search for keywords. Its immediate application is cloud… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Searchable symmetric encryption (SSE) enables a client to outsource a collection of encrypted documents in the cloud and retain… (More)
  • table 1
  • figure 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
For many computer vision problems, the most time consuming component consists of nearest neighbor matching in high-dimensional… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
A BROAD CLASS of economic search problems can be cast in the following form. There are a number of different opportunities or… (More)
  • table 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The nearest or near neighbor query problems arise in a large variety of database applications usually in the context of… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Routers must perform packet classification at high speeds to efficiently implement functions such as firewalls and QoS routing… (More)
  • figure 6
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Representing data as points in a high-dimensional space, so as to use geometric methods for indexing, is an algorithmic technique… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Sequential search methods characterized by a dynamically changing number of features included or eliminated at each step… (More)
  • figure 1
  • figure 2
Is this relevant?
1979
1979
We consider techniques for adapting linear lists so that the more frequently accessed elements are found near the front, even… (More)
Is this relevant?