Sciweavers

1778 search results - page 324 / 356
» The Theory of Probabilistic Databases
Sort
View
JCSS
2007
107views more  JCSS 2007»
14 years 9 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
TALG
2010
110views more  TALG 2010»
14 years 8 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
PPDP
2010
Springer
14 years 7 months ago
Tabling for transaction logic
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
Paul Fodor, Michael Kifer
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
14 years 7 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
DAGM
2009
Springer
14 years 7 months ago
Increasing the Dimension of Creativity in Rotation Invariant Feature Design Using 3D Tensorial Harmonics
Spherical harmonics are widely used in 3D image processing due to their compactness and rotation properties. For example, it is quite easy to obtain rotation invariance by taking t...
Henrik Skibbe, Marco Reisert, Olaf Ronneberger, Ha...