132 search results - page 15 / 27 » Optimal Database Locks for Efficient Integrity Checking |
DAC
2003
ACM
15 years 10 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
167
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
69
Voted
CIDR
2009
14 years 10 months ago
2009
R is a numerical computing environment that is widely popular for statistical data analysis. Like many such environments, R performs poorly for large datasets whose sizes exceed t...
159
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
PAMI
2006
14 years 9 months ago
2006
For shapes represented as closed planar contours, we introduce a class of functionals which are invariant with respect to the Euclidean group and which are obtained by performing i...