Filters








387,648 Hits in 4.8 sec

Key Independent Optimality [chapter]

John Iacono
2002 Lecture Notes in Computer Science  
search tree algorithm, within a multiplicative constant.  ...  Asymptotically tight upper and lower bounds are presented for key-independent optimality. Splay trees are shown to be key-independently optimal.  ...  In this definition we introduce a new form of optimality for binary search trees, key-independent optimality.  ... 
doi:10.1007/3-540-36136-7_3 fatcat:aziagxkzpzfzxgyb5l2j5yf3qy

Key-Independent Optimality

John Iacono
2005 Algorithmica  
search tree algorithm, within a multiplicative constant.  ...  Asymptotically tight upper and lower bounds are presented for key-independent optimality. Splay trees are shown to be key-independently optimal.  ...  In this definition we introduce a new form of optimality for binary search trees, key-independent optimality.  ... 
doi:10.1007/s00453-004-1136-8 fatcat:khcwqiho5zazzg2evjjsd3ev5a

A Hybrid Vector Quantization Combining a Tree Structure and a Voronoi Diagram

Yeou-Jiunn Chen, Shih-Chung Chen, Jiunn-Liang Wu
2014 Mathematical Problems in Engineering  
To efficiently reduce the search space, a tree structure integrated with principal component analysis is proposed, to rapidly determine an initial codeword in low-dimensional space.  ...  In this study, a hybrid VQ combining a tree structure and a Voronoi diagram is proposed to improve VQ efficiency.  ...  Acknowledgment The authors would like to thank the National Science Council of the Republic of China, Taiwan, for financially supporting this research under Contract NSC 102-2221-E-218-001.  ... 
doi:10.1155/2014/758734 fatcat:nw5nnomcy5bcnlkqvpocvri75y

The Power and Limitations of Static Binary Search Trees with Lazy Finger [article]

Prosenjit Bose and Karim Douïeb and John Iacono and Stefan Langerman
2013 arXiv   pre-print
The runtime of the classic root-finger tree can be expressed in terms of the entropy of the distribution of the searches, but we show that this is not the case for the optimal lazy finger tree.  ...  A non-entropy based asymptotically-tight expression for the runtime of the optimal lazy finger trees is derived, and a dynamic programming-based method is presented to compute the optimal tree.  ...  Other binary search tree data structures do not change at all during a search, for example, red-black trees [13] and AVL trees [1] .  ... 
arXiv:1304.6897v1 fatcat:pnvqojayjzh3ljat3axgnlwebm

The Power and Limitations of Static Binary Search Trees with Lazy Finger

Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman
2016 Algorithmica  
The runtime of the classic root-finger tree can be expressed in terms of the entropy of the distribution of the searches, but we show that this is not the case for the optimal lazy finger tree.  ...  A non-entropy based asymptotically-tight expression for the runtime of the optimal lazy finger trees is derived, and a dynamic programming-based method is presented to compute the optimal tree.  ...  Other binary search tree data structures do not change at all during a search, for example, red-black trees [13] and AVL trees [1] .  ... 
doi:10.1007/s00453-016-0224-x fatcat:oksirg4s4fhsbl7euqemu3yp54

A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space [chapter]

Dong Kyue Kim, Heejin Park
2005 Lecture Notes in Computer Science  
Recently, several methods were developed for constructing compressed suffix arrays and compressed suffix trees in optimal working space.  ...  The compressed suffix array and the compressed suffix tree for a given string S are full-text index data structures occupying O(n log |Σ|) bits where n is the length of S and Σ is the alphabet from which  ...  For constructing compressed suffix trees, Hon et al. [15, 16] proposed an O(n log n)-time algorithm in optimal working space.  ... 
doi:10.1007/11496656_4 fatcat:zdtzslecdvftfndeezfy3osefa

Tree decomposition based fast search of RNA structures including pseudoknots in genomes

Y. Song, C. Liu, R. Malmberg, F. Pan, L. Cai
2005 2005 IEEE Computational Systems Bioinformatics Conference (CSB'05)  
Tree decomposition yields a small tree width for such conformation graphs (e.g., ¢¡ ¤£ for stem loops and only a slight increase for pseudoknots).  ...  Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs.  ...  Acknowledgments We would like to thank the anonymous reviewers for their constructive remarks on an earlier version of this paper.  ... 
doi:10.1109/csb.2005.52 dblp:conf/csb/SongLMPC05 fatcat:gslkicpyeva5tnehygcp25qxuu

A Family-Based Evolutional Approach for Kernel Tree Selection in SVMs

Ithipan METHASATE, Thanaruk THEERAMUNKONG
2010 IEICE transactions on information and systems  
To control balance between structure and parameter search towards an optimal kernel, simulated annealing is introduced.  ...  In this paper, the concept of a family of identical-structured kernel trees is proposed to enable exploration of structure space using genetic programming whereas to pursue investigation of parameter space  ...  Structure Evolution as Global Search In our work, genetic programming (GP) is applied to search for optimal structure of a kernel function as global search.  ... 
doi:10.1587/transinf.e93.d.909 fatcat:sdla7nl7q5f3vp5slhx7rjsbra

Ternary Tree Optimalization for n-gram Indexing

Daniel Robenek, Jan Platos, Václav Snásel
2014 Databases, Texts, Specifications, Objects  
There are many data structures that can be used for this purpose, each with different characteristics. In this article the ternary search tree data structure is used.  ...  Efficiency of ternary forest is tested and compared to ternary search tree and two-level indexing ternary search tree.  ...  Data structures like B+ tree are optimized for this purpose. Second category is in-memory based indexing, which expects sufficient amount of memory for this purpose.  ... 
dblp:conf/dateso/RobenekPS14 fatcat:fqxmdkga3fetlp652bufdqrl3e

Understanding and analysis of B+ trees on NVM towards consistency and efficiency

Jiangkun Hu, Youmin Chen, Youyou Lu, Xubin He, Jiwu Shu
2020 CCF Transactions on High Performance Computing  
For example, we analyze the software layer optimizations and hardware layer optimizations separately and find that software layer optimizations do not always improve performance.  ...  Furthermore, B+ trees place multiple entries on one node and the shift and balance overhead of FPTree accounts for 39% of the total overhead.  ...  To analyze search optimizations, we implement and evaluate four B+ trees: wB+ tree with slot array optimizes search performance by slot; wB+ tree without slot array does no search optimization for its  ... 
doi:10.1007/s42514-020-00022-z fatcat:65yz26lihrdfnixtxar4urqrfy

Monte-Carlo Tree Search for Scalable Coalition Formation

Feng Wu, Sarvapali D. Ramchurn
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
We propose a novel algorithm based on Monte-Carlo tree search for the problem of coalition structure generation (CSG).  ...  Specifically, we find the optimal solution by sampling the coalition structure graph and incrementally expanding a search tree, which represents the partial space that has been searched.  ...  Monte-Carlo Tree Search Monte-Carlo tree search (MCTS) is a method for finding optimal decisions in a given domain by taking random samples in the decision space and building a search tree in an incremental  ... 
doi:10.24963/ijcai.2020/57 dblp:conf/ijcai/0001R20a fatcat:umrlmkdfxvddbbqggn37rhzvye

Index Search Algorithms for Databases and Modern CPUs [article]

Florian Gross
2017 arXiv   pre-print
While the layout of index structures has been heavily optimized for the data cache of modern CPUs, the instruction cache has been neglected so far.  ...  Over the years, many different indexing techniques and search algorithms have been proposed, including CSS-trees, CSB+ trees, k-ary binary search, and fast architecture sensitive tree search.  ...  We Whereas the optimal value for CSS-tree search is 32 keys per internal node (equivalent to two cache lines), the optimal value for NitroGen CSS-tree search is 16 keys per internal node.  ... 
arXiv:1706.06697v1 fatcat:mlxplwmmpbgk3dsohcrhhpc2ki

Monte Carlo tree search for materials design and discovery

Thaer M. Dieb, Shenghong Ju, Junichiro Shiomi, Koji Tsuda
2019 MRS Communications  
Recently, inspired by its success in the Go computer game, several approaches have applied Monte Carlo tree search (MCTS) to solve optimization problems in natural sciences including materials science.  ...  Materials design and discovery can be represented as selecting the optimal structure from a space of candidates that optimizes a target property.  ...  JPMJCR16Q5 from the Japan Science and Technology Agency (JST), and KAKENHI Grants No. 16H04274 from the Japan Society for the Promotion of Science (JSPS).  ... 
doi:10.1557/mrc.2019.40 fatcat:2z3ifvwjsrcslcc4oqjfio232u

Agent Searching in a Tree and the Optimality of Iterative Deepening

P. Dasgupta, P.P. Chakrabarti, S.C. DeSarkar
1994 ICGA Journal  
In the conventional search model it is known that DFID is asymptotically optimal for uniformed search of uniform b-ary trees.  ...  In this paper we prove the stronger result that for agent searching in uniform b-ary trees, iterative deepening is optimal up to lower-order terms.  ...  In the conventional search model it is known that DFID is asymptotically optimal for uniformed search of uniform b-ary trees.  ... 
doi:10.3233/icg-1994-17411 fatcat:dymmynsy4ffdbphuppuyr2yida

Large-vocabulary continuous speech recognition using linear lexicon search and 1-best approximation tree-structured lexicon search

Norihide Kitaoka, Nobutoshi Takahashi, Seiichi Nakagawa
2005 Systems and Computers in Japan  
The algorithm based on 1-best approximation with a tree-structured lexicon is efficient but frequently misses the optimal sentence hypothesis.  ...  We first compared search algorithms with a tree-structured lexicon using certain approximation methods and algorithms with a linear lexicon.  ...  This method guaranteed the optimal search for the best hypothesis.  ... 
doi:10.1002/scj.20252 fatcat:xyos7v4emneq3nofxflzdkrnbm
« Previous Showing results 1 — 15 out of 387,648 results