Sciweavers

3164 search results - page 278 / 633
» On Granular Knowledge Structures
Sort
View
160
Voted
ADC
2003
Springer
173views Database» more  ADC 2003»
15 years 11 months ago
Cooperative Query Answering for Semistructured Data
Semistructured data, in particular XML, has emerged as one of the primary means for information exchange and content management. The power of XML allows authors to structure a doc...
Michael Barg, Raymond K. Wong
159
Voted
FCT
2001
Springer
15 years 10 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...
190
Voted
CORR
2010
Springer
275views Education» more  CORR 2010»
15 years 6 months ago
Dictionary Optimization for Block-Sparse Representations
Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has m...
Kevin Rosenblum, Lihi Zelnik-Manor, Yonina C. Elda...
INFFUS
2006
101views more  INFFUS 2006»
15 years 6 months ago
Fusion rules for merging uncertain information
In previous papers, we have presented a logic-based framework based on fusion rules for merging structured news reports [Hun00, Hun02b, Hun02a, HS03, HS04]. Structured news report...
Anthony Hunter, Weiru Liu
AAAI
2010
15 years 4 months ago
A Lower Bound on the Size of Decomposable Negation Normal Form
We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a given vtree (known as structured DNNF). This representation of propositional knowl...
Thammanit Pipatsrisawat, Adnan Darwiche