Sciweavers

2354 search results - page 432 / 471
» Randomness, Stochasticity and Approximations
Sort
View
JCO
2010
101views more  JCO 2010»
13 years 7 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
PAMI
2010
164views more  PAMI 2010»
13 years 7 months ago
Large-Scale Discovery of Spatially Related Images
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
Ondrej Chum, Jiri Matas
SDM
2010
SIAM
129views Data Mining» more  SDM 2010»
13 years 7 months ago
Cross-Selling Optimization for Customized Promotion
The profit of a retail product not only comes from its own sales, but also comes from its influence on the sales of other products. How to promote the right products to the righ...
Nan Li, Yinghui Yang, Xifeng Yan
TCOM
2010
92views more  TCOM 2010»
13 years 7 months ago
Detection of Gaussian constellations in MIMO systems under imperfect CSI
Abstract—This paper considers the problem of Gaussian symbols detection in MIMO systems in the presence of channel estimation errors. Under this framework we develop a computatio...
Ido Nevat, Gareth W. Peters, Jinhong Yuan
VTC
2010
IEEE
172views Communications» more  VTC 2010»
13 years 7 months ago
Turbo Source Compression with Jointly Optimized Inner Irregular and Outer Irregular Codes
—In this paper, we present a near-lossless compression scheme for scalar-quantized source codec parameters based on iterative source-channel decoding (ISCD). The scheme is compar...
Laurent Schmalen, Peter Vary, Thorsten Clevorn, Ma...