4860 search results - page 591 / 972 » SNPs Problems, Complexity, and Algorithms |
159
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
147
click to vote
SIGMOD
2005
ACM
16 years 5 months ago
2005
ACM
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
138
click to vote
COMPGEOM
2006
ACM
15 years 11 months ago
2006
ACM
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
153
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
204
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...