Sciweavers

2899 search results - page 124 / 580
» Dynamic Trees in Practice
Sort
View
SCAM
2005
IEEE
14 years 2 months ago
Pointer Analysis for Source-to-Source Transformations
We present a pointer analysis algorithm designed for source-to-source transformations. Existing techniques for pointer analysis apply a collection of inference rules to a dismantl...
Marcio Buss, Stephen A. Edwards, Bin Yao, Dan G. W...
DMDW
2001
194views Management» more  DMDW 2001»
13 years 10 months ago
Logical Multidimensional Database Design for Ragged and Unbalanced Aggregation
Research on logical design of OLAP cubes has tended to assume that the rollup hierarchy in a cube dimension takes the form of a balanced tree. However, experience from industry in...
Tapio Niemi, Jyrki Nummenmaa, Peter Thanisch
ACL
1996
13 years 10 months ago
Another Facet of LIG Parsing
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...
Pierre Boullier
JACM
2006
112views more  JACM 2006»
13 years 9 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...
DKE
2007
136views more  DKE 2007»
13 years 9 months ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda