1244 search results - page 121 / 249 » Searching in Higher Dimension |
200
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
179
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
155
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
The purpose of this paper is to generalize a result by Donoho, Huo, Elad and Bruckstein on sparse representations of signals/images in a union of two orthonormal bases. We conside...
260
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
145
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
—Inspired by the contours in topography, this paper proposes a contour method for the population-based stochastic algorithms to solve the problems with continuous variables. Rely...