Sciweavers

2834 search results - page 46 / 567
» Representing Trees with Constraints
Sort
View
ICDE
2007
IEEE
137views Database» more  ICDE 2007»
14 years 10 months ago
ProVeR: Probabilistic Video Retrieval using the Gauss-Tree
Modeling objects by probability density functions (pdf) is a new powerful method to represent complex objects in databases. By representing an object as a pdf, e.g. a Gaussian, it...
Alexey Pryakhin, Christian Böhm, Matthias Sch...
IJAIT
2002
82views more  IJAIT 2002»
13 years 8 months ago
Interleaved Backtracking in Distributed Constraint Networks
The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the ...
Youssef Hamadi
JCSS
2007
107views more  JCSS 2007»
13 years 8 months ago
On the minimization of XML Schemas and tree automata for unranked trees
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
Wim Martens, Joachim Niehren
DOCENG
2004
ACM
14 years 2 months ago
Supervised learning for the legacy document conversion
We consider the problem of document conversion from the renderingoriented HTML markup into a semantic-oriented XML annotation defined by user-specific DTDs or XML Schema descrip...
Boris Chidlovskii, Jérôme Fuselier
PRICAI
2000
Springer
14 years 14 days ago
The Lumberjack Algorithm for Learning Linked Decision Forests
While the decision tree is an effective representation that has been used in many domains, a tree can often encode a concept inefficiently. This happens when the tree has to repres...
William T. B. Uther, Manuela M. Veloso