Sciweavers

520 search results - page 10 / 104
» Reductions Between Expansion Problems
Sort
View
GLOBECOM
2007
IEEE
14 years 3 months ago
Iterative Decoding of Concatenated Channel Coding and Trellis Shaping Based on Markov Model
—The trellis shaping (TS) is an effective technique not only for average power reduction of high-order QAM signals, but also for peak power reduction of band-limited single-carri...
Makoto Tanahashi, Hideki Ochiai
BIRTHDAY
2010
Springer
13 years 9 months ago
Finding Reductions Automatically
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...
Michael Crouch, Neil Immerman, J. Eliot B. Moss
SODA
2012
ACM
223views Algorithms» more  SODA 2012»
11 years 11 months ago
Data reduction for weighted and outlier-resistant clustering
Statistical data frequently includes outliers; these can distort the results of estimation procedures and optimization problems. For this reason, loss functions which deemphasize ...
Dan Feldman, Leonard J. Schulman
AAAI
2007
13 years 11 months ago
Search Space Reduction and Russian Doll Search
In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation...
Kenil C. K. Cheng, Roland H. C. Yap
APJOR
2010
131views more  APJOR 2010»
13 years 8 months ago
Metric-Preserving Reduction of Earth Mover's Distance
Earth mover's distance (EMD for short) is a perceptually meaningful dissimilarity measure between histograms. The computation of EMD reduces to a network flow optimization pro...
Yuichi Takano, Yoshitsugu Yamamoto