Sciweavers

42 search results - page 2 / 9
» Simple Effective Decipherment via Combinatorial Optimization
Sort
View
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
13 years 11 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
JSAC
2011
134views more  JSAC 2011»
12 years 11 months ago
Simple Channel Sensing Order in Cognitive Radio Networks
— In cognitive radio networks (CRNs), effective and efficient channel exploitation is imperative for unlicensed secondary users to seize available network resources and improve ...
Ho Ting Cheng, Weihua Zhuang
EOR
2006
118views more  EOR 2006»
13 years 4 months ago
Multi-objective tabu search using a multinomial probability mass function
A tabu search approach to solve multi-objective combinatorial optimization problems is developed in this paper. This procedure selects an objective to become active for a given it...
Sadan Kulturel-Konak, Alice E. Smith, Bryan A. Nor...
SOFSEM
2000
Springer
13 years 8 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
IJCNN
2006
IEEE
13 years 11 months ago
Model Selection via Bilevel Optimization
— A key step in many statistical learning methods used in machine learning involves solving a convex optimization problem containing one or more hyper-parameters that must be sel...
Kristin P. Bennett, Jing Hu, Xiaoyun Ji, Gautam Ku...