Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,796,257 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.
2017
2017
Canonical Forms for Isomorphic and Equivalent RDF Graphs
A. Hogan
ACM Transactions on the Web
2017
Corpus ID: 23891994
Existential blank nodes greatly complicate a number of fundamental operations on Resource Description Framework (RDF) graphs. In…
Expand
2015
2015
Efficient computation for probabilistic skyline over uncertain preferences
A. K. Pujari
,
Venkateswara Rao Kagita
,
Anubhuti Garg
,
V. Padmanabhan
Information Sciences
2015
Corpus ID: 9423203
Highly Cited
2014
Highly Cited
2014
Contrastive Unsupervised Word Alignment with Non-Local Features
Yang Liu
,
Maosong Sun
AAAI Conference on Artificial Intelligence
2014
Corpus ID: 9474471
Word alignment is an important natural language processing task that indicates the correspondence between natural languages…
Expand
Highly Cited
2013
Highly Cited
2013
A correlation-driven optimal service selection approach for virtual enterprise establishment
Quanwang Wu
,
Qingsheng Zhu
,
Mingqiang Zhou
Journal of Intelligent Manufacturing
2013
Corpus ID: 43202471
A virtual enterprise is an emerging business cooperation model which allows rapid response to the unpredictable market behavior…
Expand
Review
2012
Review
2012
Discover Dependencies from Data—A Review
Jixue Liu
,
Jiuyong Li
,
Chengfei Liu
,
Yongfeng Chen
IEEE Transactions on Knowledge and Data…
2012
Corpus ID: 17981371
Functional and inclusion dependency discovery is important to knowledge discovery, database semantics analysis, database design…
Expand
Highly Cited
2012
Highly Cited
2012
Generalized Higher-Order Dependency Parsing with Cube Pruning
Hao Zhang
,
Ryan T. McDonald
Conference on Empirical Methods in Natural…
2012
Corpus ID: 6469543
State-of-the-art graph-based parsers use features over higher-order dependencies that rely on decoding algorithms that are slow…
Expand
Highly Cited
2012
Highly Cited
2012
A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering
E. Danna
,
Subhasree Mandal
,
Arjun Singh
Proceedings IEEE INFOCOM
2012
Corpus ID: 2552489
One of the goals of traffic engineering is to achieve a flexible trade-off between fairness and throughput so that users are…
Expand
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
Highly Cited
2002
Highly Cited
2002
Dynamic ordered sets with exponential search trees
A. Andersson
,
M. Thorup
Journal of the ACM
2002
Corpus ID: 8175703
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered…
Expand
Highly Cited
2002
Highly Cited
2002
Optimal Bounds for the Predecessor Problem and Related Problems
P. Beame
,
Faith Ellen
Journal of computer and system sciences (Print)
2002
Corpus ID: 5691828
We obtain matching upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of…
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