Results 1 -
7 of
7
Is there a procedural logic to architecture
- In CVPR
, 2013
"... Urban models are key to navigation, architecture and entertainment. Apart from visualizing façades, a number of tedious tasks remain largely manual (e.g. compression, generating new façade designs and structurally comparing façades for classification, retrieval and clustering). We propose a novel ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
(Show Context)
Urban models are key to navigation, architecture and entertainment. Apart from visualizing façades, a number of tedious tasks remain largely manual (e.g. compression, generating new façade designs and structurally comparing façades for classification, retrieval and clustering). We propose a novel procedural modelling method to au-tomatically learn a grammar from a set of façades, gener-ate new façade instances and compare façades. To deal with the difficulty of grammatical inference, we reformu-late the problem. Instead of inferring a compromising, one-size-fits-all, single grammar for all tasks, we infer a model whose successive refinements are production rules tailored for each task. We demonstrate our automatic rule inference on datasets of two different architectural styles. Our method supercedes manual expert work and cuts the time required to build a procedural model of a façade from several days to a few milliseconds. 1.
Tree compression with top trees.
- In Proc. ICALP
, 2013
"... We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigat ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time.
Automata for Positive Core XPath Queries on Compressed Documents
- In Proceedings of LPAR’06
, 2006
"... Abstract. Given any dag t representing a fully or partially compressed XML document, we present a method for evaluating any positive unary query expressed in terms of Core XPath axes, on t, without unfolding t into a tree. To each Core XPath query of a certain basic type, we asso-ciate a word automa ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
(Show Context)
Abstract. Given any dag t representing a fully or partially compressed XML document, we present a method for evaluating any positive unary query expressed in terms of Core XPath axes, on t, without unfolding t into a tree. To each Core XPath query of a certain basic type, we asso-ciate a word automaton; these automata run on the graph of dependency between the non-terminals of the straightline regular tree grammar asso-ciated to the given dag, or along complete sibling chains in this grammar. Any given Core XPath query can be decomposed into queries of the basic type, and the answer to the query, on the dag t, can then be expressed as a sub-dag of t suitably labeled under the runs of such automata.
A Universal Grammar-Based Code For Lossless Compression of Binary Trees II,” in preparation
"... ar ..."
Automata for Analyzing and Querying Compressed Documents, Research Report
"... To cite this version: ..."
(Show Context)
Rapport n o RR-2008-09A Necessary and Sufficient Condition for Pattern Containment
"... Abstract. In this paper we introduce an approach that allows to handle the containment problem for the fragment XP(/,//, [],∗) of XPath. Using rewriting techniques we define a necessary and sufficient condition for pattern containment. This rewrite view is then adapted to query evaluation on XML doc ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. In this paper we introduce an approach that allows to handle the containment problem for the fragment XP(/,//, [],∗) of XPath. Using rewriting techniques we define a necessary and sufficient condition for pattern containment. This rewrite view is then adapted to query evaluation on XML documents, and remains valid even if the documents are given in a compressed form, as dags. 1
