46 search results - page 4 / 10 » XPath evaluation in linear time with polynomial combined com... |
CSL
2006
Springer
15 years 1 months ago
2006
Springer
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms...
167
Voted
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
JACM
2010
14 years 8 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
80
Voted
CDB
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
ICCAD
2003
IEEE
15 years 6 months ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...