86 search results - page 14 / 18 » Worst Case Optimal Union-Intersection Expression Evaluation |
105
click to vote
STACS
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
172
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
CMIG
2010
14 years 4 months ago
2010
This paper presents a novel method for unsupervised DNA microarray gridding based on Support Vector Machines (SVMs). Each spot is a small region on the microarray surface where cha...
EUROCRYPT
2012
Springer
13 years 2 days ago
2012
Springer
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
ESOP
2001
Springer
15 years 2 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...