552 search results - page 47 / 111 » On the Complexity of Join Predicates |
CSL
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
EJC
2007
13 years 10 months ago
2007
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...
TIP
1998
13 years 9 months ago
1998
—We present a method of estimating the shape of a weakly scattering binary convex polygonal object from the backscattered field. We use the concept scattering centers where it h...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
ICDE
2002
IEEE
2002
IEEE
Design and Evaluation of Alternative Selection Placement Strategies in Optimizing Continuous Queries
14 years 11 months ago
In this paper, we design and evaluate alternative selection placement strategies for optimizing a very large number of continuous queries in an Internet environment. Two grouping ...