Filters








71,622 Hits in 7.3 sec

An Efficient Language Model Using Double-Array Structures

Makoto Yasuhara, Toru Tanaka, Jun-ya Norimatsu, Mikio Yamamoto
2013 Conference on Empirical Methods in Natural Language Processing  
Next, we propose two optimization methods for improving the efficiency of data representation in the double-array structures.  ...  Embedding probabilities into unused spaces in double-array structures reduces the model size. Moreover, tuning the word IDs in the language model makes the model smaller and faster.  ...  Acknowledgments We thank the anonymous reviewers for many valuable comments. This work is supported by JSPS KAKENHI Grant Number 24650063.  ... 
dblp:conf/emnlp/YasuharaTNY13 fatcat:tkr573k77nextkyuzvni4kp2py

MergedTrie: Efficient textual indexing

Antonio Ferrández, Jesús Peral, Balaraman Ravindran
2019 PLoS ONE  
Moreover, we propose a new implementation of Tries that achieves better compression rates than the Double-Array representation usually chosen for implementing Tries.  ...  Typical data structures for textual indexing are Hash Tables and some variants of Tries such as the Double Trie (DT). In this paper, we propose an extension of the DT that we have called MergedTrie.  ...  array structure, and [46] who tried to divide the Trie into multiple levels and to remove the BASE array.  ... 
doi:10.1371/journal.pone.0215288 pmid:31013282 pmcid:PMC6478299 fatcat:3v3ayp4l6jaaxiigj6jdg43nha

BitCuts

Zhi Liu, Xiang Wang, Baohua Yang, Jun Li
2015 Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication - SIGCOMM '15  
If not, the subset needs to be divided further by constructing a bitmask and bucket array for the next layer.  ...  On the other hand, adding one additional bit to further divide small subsets is not efficient since it doubles the bucket number on the current layer but provides limited savings in the number of memory  ... 
doi:10.1145/2785956.2789998 dblp:conf/sigcomm/LiuWYL15 fatcat:6rxsuksoofhi5aa4gmnlacnhri

An efficient implementation of trie structures

Jun-Ichi Aoe, Katsushi Morimoto, Takashi Sato
1992 Software, Practice & Experience  
A new internal array structure, called a double-array, implementing a trie structure is presented. The double-array combines the fast access of a matrix form with the compactness of a list form.  ...  double-array can be from 3·1 to 5·1 times faster than that of the list.  ...  Figure 3 . 3 The reduced trie and the double-array for K Figure 4 . 4 The reduced trie and the double-array with no data is, 'b' is defined on the double-array (by the relation g(l ,'b') =4) so store  ... 
doi:10.1002/spe.4380220902 fatcat:lbda4ommarheno4l4tgsqm6aa4

A Retrieval Method for Double Array Structures by Using Byte N-Gram

Masao Fuketa, Kazuhiro Morita, Jun-Ichi Aoe
2014 Journal of clean energy technologies  
A trie is one of the data structure to retrieve keywords, and the double array is one of the implementation methods for the trie.  ...  Therefore, this paper proposes the data structure and the retrieval algorithm for the double array which represents an edge by n-byte. This paper also proposes a method to compress CODE array.  ...  When "abba" is retrieved, "ab" as the prefix word of "abba" can be retrieved. A double array is one of data structures to implement tries.  ... 
doi:10.7763/ijcte.2014.v6.855 fatcat:ifwysz62ijhddityfnnlculm7m

An Implementation Method of Trie Structure Using Xorshift

Kazuhiro Morita, Shunsuke Kanda, Masao Fuketa
2016 International Journal of Future Computer and Communication  
The double array is an excellent implementation method of a trie with high speed retrieval and compactness.  ...  Key retrieval is the most basic and important technology. The trie is one of the key retrieval methods that can be retrieved without depending on the number of registered keys.  ...  to the construction of a double array.  ... 
doi:10.18178/ijfcc.2016.5.6.476 fatcat:f36ye7vmkzgejjjxzlvlvyvzca

A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory

Crauser, Ferragina
2002 Algorithmica  
The su x array Manber-Myers, 1993 ] is one of the most attractive full-text indexing data structures due to its simplicity, space e ciency and powerful/fast search operations supported.  ...  The construction of full-text indexes on very large text collections is nowadays a hot problem.  ...  Additionally, it reduces the overall working space by making use of arrays.  ... 
doi:10.1007/s00453-001-0051-5 fatcat:ahux4xnt25fzfhn7htyziq3nxq

A Generic Parallel Collection Framework [chapter]

Aleksandar Prokopec, Phil Bagwell, Tiark Rompf, Martin Odersky
2011 Lecture Notes in Computer Science  
Finally, we give benchmarks showing the performance of parallel collection operations.  ...  We show how to implement concrete parallel collections such as parallel arrays and parallel hash maps, proposing an efficient solution to parallel hash map construction.  ...  In our case operations are performed on elements of the collection so dividing work can be done in straightforward way by partitioning the collection into element subsets.  ... 
doi:10.1007/978-3-642-23397-5_14 fatcat:hmzc4skrtfhxrfwc6n4np6mrya

DNA-nanostructure-assembly by sequential spotting

Michael Breitenstein, Peter E. Nielsen, Ralph Hölzel, Frank Fabian Bier
2019 Postprints der Universität Potsdam: Mathematisch-Naturwissenschaftliche Reihe  
Results: For the construction of DNA based nanostructures a method is presented that allows an arrangement of DNA strands in such a way that they can form a grid that only depends on the spotted pattern  ...  Once the DNA-nanoarray has been formed, it can be functionalized by PNA (peptide nucleic acid) to incorporate advanced structures.  ...  We gratefully acknowledge critical commentary and reviewing the manuscript by Dr. habil. Axel Warsinke. We like to thank Breitenstein et al.  ... 
doi:10.25932/publishup-43110 fatcat:phtowkblanhufepluq37x5vm7e

DNA-nanostructure-assembly by sequential spotting

Michael Breitenstein, Peter E Nielsen, Ralph Hölzel, Frank F Bier
2011 Journal of Nanobiotechnology  
Results: For the construction of DNA based nanostructures a method is presented that allows an arrangement of DNA strands in such a way that they can form a grid that only depends on the spotted pattern  ...  Once the DNA-nanoarray has been formed, it can be functionalized by PNA (peptide nucleic acid) to incorporate advanced structures.  ...  We gratefully acknowledge critical commentary and reviewing the manuscript by Dr. habil. Axel Warsinke. We like to thank Breitenstein et al.  ... 
doi:10.1186/1477-3155-9-54 pmid:22099392 pmcid:PMC3248840 fatcat:jhiszujchje7fimnngekxnmwq4

An Efficient Two-Level-Partitioning-Based Double Array and Its Parallelization

Lianyin Jia, Chongde Zhang, Mengjuan Li, Yinong Chen, Yong Liu, Jiaman Ding
2020 Applied Sciences  
As a fast and efficient implementation of trie, double array (DA) can effectively compress strings to reduce storage spaces.  ...  Trie is one of the most common data structures for string storage and retrieval.  ...  Yata et al. proposed a compact double array (CDA) [22] , a statically constructed compressed double array.  ... 
doi:10.3390/app10155266 fatcat:egmal5kuabegdlmgyxpdxaxwr4

A novel vertical fan-out platform based on an array of curved anodic alumina nanochannels

Chih-Yi Liu, Ming-Yu Lai, Kun-Tong Tsai, Hsuan-Hao Chang, Jr-Hau He, Jessie Shiue, Yuh-Lin Wang
2013 Nanotechnology  
The lithography is used to pattern an aluminum sheet with a custom-designed array of triangular 'cells' whose apexes are composed of nanoholes.  ...  Focused ion beam lithography and a two-step anodization have been combined to fabricate a vertical fan-out platform containing an array of unique probes.  ...  Acknowledgments This work was supported by the Advanced Optoelectronic Technology Center, National Cheng Kung University, under projects from the Ministry of Education and the National Science Council  ... 
doi:10.1088/0957-4484/24/5/055306 pmid:23324798 fatcat:a3vsxvy2sbcrvencaihkfd54dq

Chromatin structure-dependent conformations of the H1 CTD

He Fang, Sijie Wei, Tae-Hee Lee, Jeffrey J. Hayes
2016 Nucleic Acids Research  
However, H1 CTD structure when bound to nucleosomes in arrays is distinct from that induced upon H1 association with mononucleosomes or bare double stranded DNA.  ...  We provide evidence that linker DNA conformation is a key determinant of H1 CTD structure and that constraints imposed by neighboring nucleosomes cause linker DNAs to adopt distinct trajectories in oligonucleosomes  ...  To test this possibility, we prepared arrays in which the H1:nucleosome stoichiometry was reduced so that on average only one H1 would be bound to each array.  ... 
doi:10.1093/nar/gkw586 pmid:27365050 pmcid:PMC5100576 fatcat:du4qbqilvbfy3cn4ucrveu5wou

Recursive individually distributed object [chapter]

Z. George Mou
1999 Lecture Notes in Computer Science  
Programming by divide-and-conquer is therefore e ectively supported under this framework.  ...  Moreover, we propose a set of functionally orthogonal operations for the objects which allow the objects to be recursively divided, combined, and communicate over recursively divided address space.  ...  The implementation of the model under the BORG project at the Applied Physics Laboratory is built on top of the Java language and the CORBA architecture.  ... 
doi:10.1007/bfb0097888 fatcat:5bkvc4misvfklgipo2l6fj5whq

NEW U-SHAPED DGS BANDSTOP FILTERS

Jian-Kang Xiao, Yu-Feng Zhu
2012 Progress In Electromagnetics Research C  
In this paper, new microstrip bandstop filters with single band, dual-band and tri-band by using U-shaped defected ground structures are presented without the assistance of coupled lines or certain resonators  ...  and minimum defected patterns which reduce the circuit size.  ...  ACKNOWLEDGMENT This work was supported in part by Research Fund of China State Key Laboratory of Millimeter Waves (K201107).  ... 
doi:10.2528/pierc11091805 fatcat:wfxw3et4anfanmrl3qx5bphnhm
« Previous Showing results 1 — 15 out of 71,622 results