Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,651,504 papers from all fields of science
Search
Sign In
Create Free Account
Exponential search
In computer science, an exponential search (also called doubling search or galloping search) is an algorithm, created by Jon Bentley and Andrew Chi…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Algorithm
Array data structure
Computer science
Cycle detection
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
New evolutionary algorithms for mining interesting association rules
M. Kabir
2016
Corpus ID: 126265062
This PHD thesis deals with the evolutionary algorithms for mining frequent patterns and discovering useful and interesting…
Expand
2015
2015
Combinatorial abstraction refinement for feasibility analysis of static priorities
Martin Stigge
,
W. Yi
Real-time systems
2015
Corpus ID: 13974175
Combinatorial explosion is a challenge for many analysis problems in the theory of hard real-time systems. One of these problems…
Expand
2011
2011
Reassembling Thin Artifacts of Unknown Geometry
Geoffrey Oxholm
,
K. Nishino
IEEE Conference on Visual Analytics Science and…
2011
Corpus ID: 15005232
We introduce a novel reassembly method for fragmented, thin objects that uses minimal user interaction. Unlike past methods, we…
Expand
2011
2011
LORD: Tracking mobile clients in a real mesh
Mehdi Bezahaf
,
L. Iannone
,
M. Amorim
,
S. Fdida
Ad hoc networks
2011
Corpus ID: 30629439
2005
2005
Architecture-adaptive routability-driven placement for FPGAs
Akshay Sharma
,
C. Ebeling
,
S. Hauck
International Conference on Field-Programmable…
2005
Corpus ID: 327454
Current FPGA placement algorithms estimate the routability of a placement using architecture-specific metrics. The shortcoming of…
Expand
2003
2003
Semantic Representation and Correspondence for State-Based Motion Transition
Golam Ashraf
,
Kok Cheong Wong
IEEE Transactions on Visualization and Computer…
2003
Corpus ID: 1515829
Consistent transition algorithms preserve salient source motion features by establishing feature-based correspondence between…
Expand
2003
2003
ATPG-based preimage computation: efficient search space pruning with ZBDD
Kameshwar Chandrasekar
,
M. Hsiao
Eighth IEEE International High-Level Design…
2003
Corpus ID: 2614045
Computing image/preimage is a fundamental step in formal verification of hardware systems. Conventional OBDD-based methods for…
Expand
2001
2001
Towards Optimal ǫ-Approximate Nearest Neighbor Algorithms in Constant Dimensions
Matthew Cary
2001
Corpus ID: 16089507
The nearest neighbor (NN) problem on a set of n points P , is to build a data structure that when given a query point q, finds p…
Expand
1995
1995
A Constant Time Algorithm for Theorem Proving in Propositional Logic on Reconfigurable Meshes
B. Pradeep
,
C. Murthy
Information Sciences
1995
Corpus ID: 12302477
1994
1994
Spectral Techniques for Technology Mapping
J. C. Yang
,
G. Demicheli
1994
Corpus ID: 16162193
Technology mapping is the crucial step in logic synthesis where technology dependent optimizations take place. The matching phase…
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