Filters








5,532 Hits in 6.9 sec

A novel XML document structure comparison framework based-on sub-tree commonalities and label semantics

Joe Tekli, Richard Chbeir
2012 Journal of Web Semantics  
Various algorithms for comparing hierarchically structured data, XML documents in particular, have been proposed in the literature.  ...  Most of them make use of techniques for finding the edit distance between tree structures, XML documents being commonly modeled as Ordered Labeled Trees.  ...  Acknowledgements We are grateful to the reviewers for their valuable comments and suggestions which have allowed us to further improve the manuscript"s presentation, organization, and contents.  ... 
doi:10.1016/j.websem.2011.10.002 fatcat:my7zr64bgzdebawdwoxqjwnt64

Unsupervised Sub-tree Alignment for Tree-to-Tree Translation

T. Xiao, J. Zhu
2013 The Journal of Artificial Intelligence Research  
Experimental results show that the proposed approach outperforms three state-of-the-art baseline approaches in both alignment accuracy and grammar quality.  ...  translation rules that are often filtered out due to the errors in 1-best alignment.  ...  that Equation (8) is not an approximation.  ... 
doi:10.1613/jair.4033 fatcat:tvkuj36omvdivkbstmnmdcxc4u

A post-processing scheme for malayalam using statistical sub-character language models

Karthika Mohan, C. V. Jawahar
2010 Proceedings of the 8th IAPR International Workshop on Document Analysis Systems - DAS '10  
We use a multi-stage graph representation and formulate the recognition task as an optimization problem.  ...  It is well known that word accuracy decreases as the number of characters in a word increase. For Malayalam, the average number of characters in a word is almost twice that of English.  ...  Algorithm 2 Symbol level smoothing Require: N, set of words W 1: for each word w in W do 2: Convert w to S, set of symbols s1, s2, s3...sn 3: Reorder elements in S 4: for each symbol si in S do 5: Record  ... 
doi:10.1145/1815330.1815394 dblp:conf/das/MohanJ10 fatcat:4mmiflgiazai5b52nw4aahak2a

Fluid-Mediated Stochastic Self-Assembly at Centimetric and Sub-Millimetric Scales: Design, Modeling, and Control

Bahar Haghighat, Massimo Mastrangeli, Grégory Mermoud, Felix Schill, Alcherio Martinoli
2016 Micromachines  
In the quest of a unifying control and modeling framework and within the broader perspective of investigating how stochastic control strategies can be adapted from the centimeter-scale down to the (sub  ...  , constituted of modules from centimetric down to sub-millimetric size.  ...  Figure 9 .Figure 10 . 910 Self-assembly sequence for target cluster of size: three [10] . (a) 2.00 s, assembly mode; (b) 2.80 s, disassembly mode; (c) 3.92 s, target structure achieved.  ... 
doi:10.3390/mi7080138 pmid:30404309 pmcid:PMC6190313 fatcat:3alzv3fthra7lgdywdotwo2dse

Combining Stochastic Grammar and Semi-Supervised Learning Techniques to Extract RNA Structures with Pseudoknots

Sixin Tang
2019 International Journal of Performability Engineering  
In order to use a large number of unlabeled RNA sequences effectively for structure prediction, the combination of stochastic grammar and semi-supervised learning techniques has been proposed.  ...  In these techniques, we used a small amount of labeled RNA sequences and a large number of unlabeled sequences as a training set of the prediction model.  ...  Since lemma sequence S and RNA sequence R are approximately equal, P(R | S, T) can be approximated as 1.  ... 
doi:10.23940/ijpe.19.07.p21.19391946 fatcat:j4qw664sgjezzcss2bhtcwwatq

Automated Assistance for Search-Based Refactoring Using Unfolding of Graph Transformation Systems [chapter]

Fawad Qayum
2010 Lecture Notes in Computer Science  
In addition, I would like to thank many other members of the Department i of Computer Science at the University of Leicester for their help, and for creating a friendly and welcoming environment for work  ...  Adbdul Qayum Khan (Late) who taught me that the best kind of knowledge to have is that which is learned for its own sake. God rest his soul in peace. Ameen!  ...  I attribute the level of my PhD degree to his encouragement and effort and without him this thesis, too, would not have been completed or written.  ... 
doi:10.1007/978-3-642-15928-2_34 fatcat:dkwpg3ylnbdwtadpklbvrfogum

Toward a Unified Sub-symbolic Computational Theory of Cognition

Martin V. Butz
2016 Frontiers in Psychology  
The activated, interactive network attractor essentially characterizes the semantics of a concept or a concept composition, such as an actual or imagined situation in our environment.  ...  Temporal successions of attractors then encode unfolding semantics, which may be generated by a behavioral or mental interaction with an actual or imagined situation in our environment.  ...  the findings in a qualitative fashion.  ... 
doi:10.3389/fpsyg.2016.00925 pmid:27445895 pmcid:PMC4915327 fatcat:ooijvt4uabaglcwm4w7aydubfy

XML document-grammar comparison: related problems and applications

Joe Tekli, Richard Chbeir, Agma Traina, Caetano Traina
2011 Open Computer Science  
, as well as alert filtering in intrusion detection systems and Web Services matching and communications.  ...  In this paper, we provide an overview on existing research related to XML document/grammar comparison, presenting the background and discussing the various techniques related to the problem.  ...  ACKNOWLEDGEMENT This work was supported in part by the Research Support Foundation of the State of Sao Paulo, FAPESP Postdoctoral Fellowship n# 2010/00330-2.  ... 
doi:10.2478/s13537-011-0005-1 fatcat:d3xfbs7yz5bwtfyceautkzvnsa

Modeling Dynamic Programming Problems over Sequences and Trees with Inverse Coupled Rewrite Systems

Robert Giegerich, H´el'ene Touzet
2014 Algorithms  
Recursive problem decomposition, tabulation of intermediate results for re-use, and Bellman's Principle of Optimality are its well-understood ingredients.  ...  Dynamic programming is a classical algorithmic paradigm, which often allows the evaluation of a search space of exponential size in polynomial time.  ...  Acknowledgments Thanks go to Michael Hanus and Benedikt Löwes for help with implementing two ICOREs in the functional-logic language Curry. Thanks to B. Löwes also for a careful reading of the text.  ... 
doi:10.3390/a7010062 fatcat:swsio2xkvvhgroq2ltjp6n2kaa

A grammar-based unification of several alignment and folding algorithms

F Lefebvre
1996 Proceedings. International Conference on Intelligent Systems for Molecular Biology  
We show in this paper that many popular models of folding and/or alignment may be described by a new formalism: multi-tape S-attribute grammars (MT-SAG's).  ...  To complete this formalism, we designed and implemented a tool which, given a MTSAG, will output an efficient parser for this grammar.  ...  Steyaert for useful suggestions and comments. I am grateful to L. Grate for data on UCSC's SCFG experiments and F. Corpet for providing me with the source of the RNAlign tool. Lefebvre  ... 
pmid:8877514 fatcat:yiq457ouhnhuvggcmcwx7wkai4

An overview on XML similarity: Background, current trends and future directions

Joe Tekli, Richard Chbeir, Kokou Yetongnon
2009 Computer Science Review  
Owing to an unparalleled increasing use of the XML standard, developing efficient techniques for comparing XML-based documents becomes essential in the database and information retrieval communities.  ...  In recent years, XML has been established as a major means for information management, and has been broadly utilized for complex data representation (e.g. multimedia objects).  ...  The authors provide an algorithm dedicated to comparing an XML document and a DTD grammar.  ... 
doi:10.1016/j.cosrev.2009.03.001 fatcat:c3mvd7her5ae3ohbip25c753b4

BOSS: Bayesian Optimization over String Spaces [article]

Henry B. Moss, Daniel Beck, Javier Gonzalez, David S. Leslie, Paul Rayson
2020 arXiv   pre-print
This article develops a Bayesian optimization (BO) method which acts directly over raw strings, proposing the first uses of string kernels and genetic algorithms within BO loops.  ...  Experiments demonstrate considerably improved optimization over existing approaches across a broad range of constraints, including the popular setting where syntax is governed by a context-free grammar  ...  The research was supported by EPSRC, the STOR-i Centre for Doctoral Training and a visiting researcher grant from the University of Melbourne.  ... 
arXiv:2010.00979v1 fatcat:dryufghyzrgc7f2jt6sf3b35yu

Optimizing queries on files

Mariano P. Consens, Tova Milo
1994 SIGMOD record  
We show that text indexing, combined with newly developed optimization techniques, can be used to provide an efficient high level interface to information stored in files.  ...  We present a framework which allows the user to access and manipulate data uniformly, regardless of whether it resides in a database or in the file system (or in both).  ...  Acknowledgments: We would like to thank Vassos Hadzilacos for his fruitful suggestions, and Frank Tompa and Pekka Kilpelainen for detailed comments on a preliminary version of thk paper.  ... 
doi:10.1145/191843.191898 fatcat:stcl62jktndqdbdftp6d7c5lpe

Optimizing queries on files

Mariano P. Consens, Tova Milo
1994 Proceedings of the 1994 ACM SIGMOD international conference on Management of data - SIGMOD '94  
We show that text indexing, combined with newly developed optimization techniques, can be used to provide an efficient high level interface to information stored in files.  ...  We present a framework which allows the user to access and manipulate data uniformly, regardless of whether it resides in a database or in the file system (or in both).  ...  Acknowledgments: We would like to thank Vassos Hadzilacos for his fruitful suggestions, and Frank Tompa and Pekka Kilpelainen for detailed comments on a preliminary version of thk paper.  ... 
doi:10.1145/191839.191898 dblp:conf/sigmod/ConsensM94 fatcat:quyshsyjrbbepg45hvlietau6e

Using attributed flow graph parsing to recognize clichés in programs [chapter]

Linda Mary Wills
1996 Lecture Notes in Computer Science  
The formalism includes mechanisms for tolerating variations in programs due to structure sharing (a common optimization in which a structural component is used to play more than one functional role).  ...  Examples of clich es are algorithmic computations, such a s l i s t e n umeration, binary search, and event-driven simulation,and common data structures, such as priority q u e u e and hash table.  ...  Support for the laboratory's research has been provided in part by the following organizations: National Science Foundation under grants IRI-8616644 and CCR-898273, Advanced Research Projects Agency of  ... 
doi:10.1007/3-540-61228-9_86 fatcat:mwifzhu2vrebtaerzcllb7gxrq
« Previous Showing results 1 — 15 out of 5,532 results