415 search results - page 53 / 83 » Optimal query complexity bounds for finding graphs |
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
In this paper we describe novel techniques that make it possible to build an industrial-strength tool for automating the choice of indexes in the physical design of a SQL database...
JAR
2007
13 years 7 months ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
DAC
1994
ACM
13 years 11 months ago
1994
ACM
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...