Sciweavers

2370 search results - page 71 / 474
» A Structured Set of Higher-Order Problems
Sort
View
IDEAS
2007
IEEE
146views Database» more  IDEAS 2007»
14 years 3 months ago
Approximate Structural Matching over Ordered XML Documents
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
Nitin Agarwal, Magdiel Galan Oliveras, Yi Chen
DASFAA
2009
IEEE
136views Database» more  DASFAA 2009»
14 years 3 months ago
A Two-Tire Index Structure for Approximate String Matching with Block Moves
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
Bin Wang, Long Xie, Guoren Wang
CP
2006
Springer
14 years 21 days ago
Static and Dynamic Structural Symmetry Breaking
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dom...
Pierre Flener, Justin Pearson, Meinolf Sellmann, P...
JMLR
2010
115views more  JMLR 2010»
13 years 3 months ago
Bayesian structure discovery in Bayesian networks with less space
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
Pekka Parviainen, Mikko Koivisto
IJCAI
2007
13 years 10 months ago
Incremental Construction of Structured Hidden Markov Models
This paper presents an algorithm for inferring a Structured Hidden Markov Model (S-HMM) from a set of sequences. The S-HMMs are a sub-class of the Hierarchical Hidden Markov Model...
Ugo Galassi, Attilio Giordana, Lorenza Saitta