Sciweavers

664 search results - page 48 / 133
» The tree Constraint
Sort
View
SIGMOD
1999
ACM
132views Database» more  SIGMOD 1999»
14 years 1 days ago
Mind Your Vocabulary: Query Mapping Across Heterogeneous Information Sources
In this paper we present a mechanism for translating constraint queries, i.e., Boolean expressions of constraints, across heterogeneous information sources. Integrating such syste...
Kevin Chen-Chuan Chang, Hector Garcia-Molina
AI
2010
Springer
13 years 7 months ago
AllDifferent-based filtering for subgraph isomorphism
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
Christine Solnon
GRAMMARS
2000
89views more  GRAMMARS 2000»
13 years 7 months ago
Monotonic C-Command: A New Perspective on Tree Adjoining Grammar
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the ...
Robert Frank, Seth Kulick, K. Vijay-Shanker
TOG
2008
103views more  TOG 2008»
13 years 7 months ago
Sketch-based tree modeling using Markov random field
In this paper, we describe a new system for converting a user's freehand sketch of a tree into a full 3D model that is both complex and realistic-looking. Our system does thi...
Xuejin Chen, Boris Neubert, Ying-Qing Xu, Oliver D...
CP
2007
Springer
14 years 1 months ago
A Compression Algorithm for Large Arity Extensional Constraints
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
George Katsirelos, Toby Walsh