2514 search results - page 225 / 503 » On the Computation of Approximations of Database Queries |
162
click to vote
ICALP
2007
Springer
16 years 24 days ago
2007
Springer
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...
190
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
166
click to vote
CIKM
2004
Springer
16 years 1 days ago
2004
Springer
An important class of queries is the LIKE predicate in SQL. In the absence of an index, LIKE queries are subject to performance degradation. The notion of indexing on substrings (...
181
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
162
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...