Sciweavers

1091 search results - page 137 / 219
» On the temporal dimension of search
Sort
View
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
15 years 11 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
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...
Andrey Balmin, Emiran Curtmola
ICIP
2003
IEEE
16 years 1 months ago
Sparse decompositions in "incoherent" dictionaries
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...
Morten Nielsen, Rémi Gribonval
ICDE
2003
IEEE
96views Database» more  ICDE 2003»
16 years 1 months ago
Pushing Aggregate Constraints by Divide-and-Approximate
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...
Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong...
CEC
2008
IEEE
15 years 6 months ago
A contour method in population-based stochastic algorithms
—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...
Ying Lin, Jun Zhang, Lu-kai Lan
ICASSP
2008
IEEE
15 years 6 months ago
Blind source separation using monochannel overcomplete dictionaries
We propose a new approach to underdetermined Blind Source Separation (BSS) using sparse decomposition over monochannel dictionary atoms and compare it to multichannel dictionary a...
B. Vikrham Gowreesunker, Ahmed H. Tewfik