3317 search results - page 647 / 664 » Strategies in Rigid-Variable Methods |
124
Voted
ESEC
1999
Springer
15 years 8 months ago
1999
Springer
Imagine some program and a number of changes. If none of these changes is applied (“yesterday”), the program works. If all changes are applied (“today”), the program does n...
152
Voted
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
148
Voted
VISUALIZATION
1997
IEEE
15 years 7 months ago
1997
IEEE
This paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being ...
111
click to vote
VLDB
1997
ACM
15 years 7 months ago
1997
ACM
R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadt...
151
Voted
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...