Sciweavers

4934 search results - page 687 / 987
» complexity 2008
Sort
View
CIKM
2008
Springer
15 years 8 months ago
Rewriting of visibly pushdown languages for xml data integration
In this paper, we focus on XML data integration by studying rewritings of XML target schemas in terms of source schemas. Rewriting is very important in data integration systems wh...
Alex Thomo, Srinivasan Venkatesh
CSL
2008
Springer
15 years 8 months ago
An Infinite Automaton Characterization of Double Exponential Time
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...
Salvatore La Torre, P. Madhusudan, Gennaro Parlato
FMICS
2008
Springer
15 years 8 months ago
Extending Structural Test Coverage Criteria for Lustre Programs with Multi-clock Operators
Lustre is a formal synchronous declarative language widely used for modeling and specifying safety-critical applications in the elds of avionics, transportation or energy productio...
Virginia Papailiopoulou, Laya Madani, Lydie du Bou...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 9 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
DCC
2008
IEEE
16 years 6 months ago
Filter Banks for Prediction-Compensated Multiple Description Coding
This paper investigates the design and application of the optimal filter banks for a predictioncompensated multiple description coding (PC-MDC) scheme, where the coefficients in e...
Jing Wang, Jie Liang