Search Results - Offline binary search tree algorithms

The cost of offline binary search tree algorithms and the complexity of the request sequence by Kujala, Jussi, Elomaa, Tapio

“… We obtain several applications for this result. First, any offline binary search tree algorithm can be at most a constant factor away from the entropy of the process producing the request sequence…”
Get full text

Efficient single pattern searching algorithm for offline text by using binary search tree (ESPS Algorithm) by Mishra, Sattyam Kishor, Pandey, Manish, Astya, Parma Nand

“… The efficiency of proposed algorithm is improved by adopting binary search tree and SDBM hash function techniques…”
Get full text

Fast Model Predictive Control Combining Offline Method and Online Optimization with K-D Tree by Shao, Zhijiang, Zhao, Jun, Xu, Zuhua, Ding, Yi

“…). This paper presents a fast model predictive control algorithm that combines offline method and online optimization to solve the MPC problem…”
Get full text

Bang-Bang Pulse Magnitude Modulation and Binary Search Tree-Based Voltage Balancing Method of Multilevel Inverter for Wireless Power Transfer by Guo, Jian, Chau, K. T., Liu, Wei, Hou, Yunhe, Pang, Hongliang

“…) and continuous output, but the resolution is fixed, and the heavy computational burden of the voltage balancing algorithm is a concerning issue…”
Get full text

Belga B-Trees by Demaine, Erik D., Iacono, John, Koumoutsos, Grigorios, Langerman, Stefan

“… ( log log N ) -competitive with the runtime of the best offline binary search tree on every sequence of searches…”
Get full text

Shape matching using a binary search tree structure of weak classifiers by Tsapanos, Nikolaos, Tefas, Anastasios, Nikolaidis, Nikolaos, Pitas, Ioannis

“…In this paper, a novel algorithm for shape matching based on the Hausdorff distance and a binary search tree data structure is proposed…”
Get full text

Fast and Accurate Hashing Via Iterative Nearest Neighbors Expansion by Jin, Zhongming, Zhang, Debing, Hu, Yao, Lin, Shiding, Cai, Deng, He, Xiaofei

“…Recently, the hashing techniques have been widely applied to approximate the nearest neighbor search problem in many real applications…”
Get full text

Pattern-Avoiding Access in Binary Search Trees by Chalermsook, Parinya, Goswami, Mayank, Kozma, Laszlo, Mehlhorn, Kurt, Saranurak, Thatchaphol

“…The dynamic optimality conjecture is perhaps the most fundamental open question about binary search trees (BST…”
Get full text

On Dynamic Optimality for Binary Search Trees by Goyal, Navin, Gupta, Manoj

“…Does there exist O(1)-competitive (self-adjusting) binary search tree (BST) algorithms? This is a well-studied problem…”
Get full text

Key-Independent Optimality by Iacono, John

Get full text

In pursuit of the dynamic optimality conjecture by Iacono, John

“… Splay trees were conjectured to perform within a constant factor as any offline rotation-based search tree algorithm on every sufficiently long sequence---any binary search tree algorithm…”
Get full text

Low voltage ride through enhancement in DFIG based WECS by hybrid method by G, Angala Parameswari, Sait, Habeebullah

“… (DFIG) based Wind Energy Conversion System (WECS). The proposed hybrid technique is the joint execution of S-shaped binary version of Whale Optimisation Algorithm (S-bWOA…”
Get full text

Reducing process delays for real-time earthquake parameter estimation – An application of KD tree to large databases for Earthquake Early Warning by Yin, Lucy, Andrews, Jennifer, Heaton, Thomas

“… We propose to use a multidimensional binary search tree (KD tree) data structure to organize large seismic databases to reduce the processing time in nearest neighbor search for predictions…”
Get full text

Multi-finger binary search trees by Chalermsook, Parinya, Goswami, Mayank, Kozma, László, Mehlhorn, Kurt, Saranurak, Thatchaphol

“…We study multi-finger binary search trees (BSTs), a far-reaching extension of the classical BST model, with connections to the well-studied \(k\)-server problem…”
Get full text

Fault Diagnosis of Hierarchical Discrete-Event Systems Based on State-Tree Structures by Wang, Deguang, Wang, Xi, Yang, Jing, Li, Zhiwu

“…In this article, fault diagnosis of hierarchical discrete event systems (HDES) is investigated using state-tree structures (STS…”
Get full text

Pinning Down the Strong Wilber 1 Bound for Binary Search Trees by Chalermsook, Parinya, Chuzhoy, Julia, Saranurak, Thatchaphol

“…The dynamic optimality conjecture, postulating the existence of an \(O(1)\)-competitive online algorithm for binary search trees (BSTs…”
Get full text

Lower bounds for accessing binary search trees with rotations by Wilber, Robert

“…We describe two methods for obtaining lower bounds on the cost of accessing a sequence of nodes of a symmetrically ordered binary search tree, where rotations can be done on the tree…”
Get full text

The Geometry of Binary Search Trees by Demaine, Erik D, Harmon, Dion, Iacono, John, Kane, Daniel, Patrascu, Mihai

“…This paper presents a novel connection between binary search trees (BSTs) and points in the plane satisfying a simple property…”
Get full text

Arboral satisfaction: Recognition and LP approximation by Demaine, Erik D., Ganesan, Varun, Kontsevoi, Vladislav, Liu, Qipeng, Liu, Quanquan, Ma, Fermi, Nachum, Ofir, Sidford, Aaron, Waingarten, Erik, Ziegler, Daniel

“… At SODA 2009, Demaine, Harmon, Iacono, Kane, and Pǎtrascu proved a connection between the longstanding dynamic optimality conjecture about binary search trees…”
Get full text

Active Jet Noise Control of Turbofan Engine Based on Explicit Model Predictive Control by Ji, Runmin, Huang, Xianghua, Zhao, Xiaochun

“… The online computational burden of MPC was transferred to offline computation…”
Get full text