Sciweavers

807 search results - page 48 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
BMCBI
2010
163views more  BMCBI 2010»
15 years 4 months ago
Reduced representation of protein structure: implications on efficiency and scope of detection of structural similarity
Background: Computational comparison of two protein structures is the starting point of many methods that build on existing knowledge, such as structure modeling (including modeli...
Zong Hong Zhang, Hwee Kuan Lee, Ivana Mihalek
SIGDIAL
2010
15 years 1 months ago
Probabilistic Ontology Trees for Belief Tracking in Dialog Systems
We introduce a novel approach for robust belief tracking of user intention within a spoken dialog system. The space of user intentions is modeled by a probabilistic extension of t...
Neville Mehta, Rakesh Gupta, Antoine Raux, Deepak ...
TKDE
2008
153views more  TKDE 2008»
15 years 3 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang
SOFSEM
2000
Springer
15 years 7 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
SEMWEB
2007
Springer
15 years 10 months ago
RDFSync: Efficient Remote Synchronization of RDF Models
In this paper we describe RDFSync, a methodology for efficient synchronization and merging of RDF models. RDFSync is based on decomposing a model into Minimum Self-Contained graphs...
Giovanni Tummarello, Christian Morbidoni, Reto Bac...