2514 search results - page 433 / 503 » On the Computation of Approximations of Database Queries |
106
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
104
Voted
COMPGEOM
2007
ACM
15 years 4 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
208
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper addresses the problem of efficient maintenance of a materialized skyline view in response to skyline removals. While there has been significant progress on skyline quer...
174
Voted
KDD
2000
ACM
15 years 4 months ago
2000
ACM
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
113
click to vote
ICIP
2006
IEEE
16 years 2 months ago
2006
IEEE
The Visual Thesaurus is a new query approach when no starting image is available. It is a concise representation of all similar regions in a panel of visual patches; the user arra...