Sciweavers

4908 search results - page 114 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
DCC
2004
IEEE
15 years 10 months ago
Model Based Optimal Bit Allocation
Modeling of the operational rate-distortion characteristics of a signal can significantly reduce the computational complexity of an optimal bit allocation algorithm. In this repor...
Nasir Rajpoot
TCOM
2011
83views more  TCOM 2011»
15 years 1 months ago
Minimizing Sum-MSE Implies Identical Downlink and Dual Uplink Power Allocations
—Minimizing the sum of mean squared errors using linear transceivers under a sum power constraint in the multiuser downlink is a non-convex problem. Existing algorithms exploit a...
Adam J. Tenenbaum, Raviraj S. Adve
JMLR
2010
182views more  JMLR 2010»
15 years 1 months ago
Quadratic Programming Feature Selection
Identifying a subset of features that preserves classification accuracy is a problem of growing importance, because of the increasing size and dimensionality of real-world data se...
Irene Rodriguez-Lujan, Ramón Huerta, Charle...
GECCO
2005
Springer
220views Optimization» more  GECCO 2005»
15 years 12 months ago
Scale invariant pareto optimality: a meta--formalism for characterizing and modeling cooperativity in evolutionary systems
This article describes a mathematical framework for characterizing cooperativity in complex systems subject to evolutionary pressures. This framework uses three foundational compo...
Mark Fleischer
JEC
2006
69views more  JEC 2006»
15 years 6 months ago
Application partitioning on programmable platforms using the ant colony optimization
Modern digital systems consist of a complex mix of computational resources, e.g. microprocessors, memory elements and reconfigurable logic. System partitioning
Gang Wang, Wenrui Gong, Ryan Kastner