526 search results - page 49 / 106 » Representations of structural closure operators |
112
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
TCS
1998
14 years 11 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
102
click to vote
ICDT
2010
ACM
14 years 10 months ago
2010
ACM
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
115
click to vote
ICDE
2006
IEEE
15 years 5 months ago
2006
IEEE
— XML stream applications bring the challenge of efficiently processing queries on sequentially accessible tokenbased data. For efficient processing of queries, we need to ensu...