Sciweavers

4908 search results - page 15 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
TCOM
2010
80views more  TCOM 2010»
15 years 8 days ago
Near optimal training sequences for low complexity symbol timing estimation in MIMO systems
—Training sequences for data-aided timing estimation in multi-input multi-output systems are designed. It is observed that for low complexity implementation, the sequences must n...
Ketan Rajawat, Ajit K. Chaturvedi
KDD
2005
ACM
106views Data Mining» more  KDD 2005»
16 years 2 months ago
Simultaneous optimization of complex mining tasks with a knowledgeable cache
With an increasing use of data mining tools and techniques, we envision that a Knowledge Discovery and Data Mining System (KDDMS) will have to support and optimize for the followi...
Ruoming Jin, Kaushik Sinha, Gagan Agrawal
ICC
2007
IEEE
137views Communications» more  ICC 2007»
15 years 8 months ago
Optimality and Complexity of Opportunistic Spectrum Access: A Truncated Markov Decision Process Formulation
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...
Dejan V. Djonin, Qing Zhao, Vikram Krishnamurthy
CEC
2005
IEEE
15 years 7 months ago
Complementary selection and variation for an efficient multiobjective optimization of complex systems
Real-world applications generally distinguish themselves from theoretical developments in that they are much more complex and varied. As a consequence, better models require more d...
Benoît Bagot, Hartmut Pohlheim
ICIC
2007
Springer
15 years 8 months ago
An Improved Nested Partitions Algorithm Based on Simulated Annealing in Complex Decision Problem Optimization
: - This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of ...
Yan Luo, Changrui Yu