19798 search results - page 661 / 3960 » Is Structural Subtyping Useful |
165
Voted
CIKM
2007
Springer
16 years 27 days ago
2007
Springer
Modern web search engines are expected to return top-k results efficiently given a query. Although many dynamic index pruning strategies have been proposed for efficient top-k com...
188
Voted
DCC
2000
IEEE
15 years 11 months ago
2000
IEEE
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
182
click to vote
PLDI
1999
ACM
15 years 11 months ago
1999
ACM
Hardware trends have produced an increasing disparity between processor speeds and memory access times. While a variety of techniques for tolerating or reducing memory latency hav...
216
click to vote
COCOON
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
171
Voted
BIBE
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we investigate a new approach for literature mining. We use frequent subgraph mining, and its generalization topological structure mining, for finding interesting re...