2924 search results - page 215 / 585 » Lower Bounds in Distributed Computing |
125
click to vote
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
103
click to vote
SCN
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...
105
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...
124
click to vote
COR
2008
15 years 2 months ago
2008
An approach is proposed for generating homogenous three-staged cutting patterns for the constrained two-dimensional guillotinecutting problems of rectangles. It is based on branch...
150
Voted
SIAMNUM
2010
14 years 10 months ago
2010
We derive a posteriori error estimates for the discretization of the heat equation in a unified and fully discrete setting comprising the discontinuous Galerkin, finite volume, mix...