4137 search results - page 623 / 828 » On the number of matchings of a tree |
AGENTS
2000
Springer
14 years 16 days ago
2000
Springer
Abstract. One of the reasons for attending to agent technology is the evergrowing complexity of information systems and the increasing difficulty to foresee and plan for all potent...
CIKM
2000
Springer
14 years 16 days ago
2000
Springer
The complexity of deploying high-performance spatial structures in transactional DBMS environments has motivated researchers to experiment with the idea of reusing the effort inve...
SIGMOD
1999
ACM
14 years 15 days ago
1999
ACM
The database query optimizer requires the estimation of the query selectivity to find the most efficient access plan. For queries referencing multiple attributes from the same rel...
IWCC
1999
IEEE
14 years 14 days ago
1999
IEEE
In this paper, we present techniques and algorithms to improve the performance of various communication patterns on message-passing platforms where, for reasons of safety, user-le...
FOCS
1998
IEEE
14 years 13 days ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...