Sciweavers

1469 search results - page 252 / 294
» Approximate polynomial decomposition
Sort
View
4OR
2010
137views more  4OR 2010»
15 years 1 days ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...
CORR
2010
Springer
182views Education» more  CORR 2010»
14 years 12 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
COLT
2010
Springer
14 years 10 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha
ICDE
2009
IEEE
163views Database» more  ICDE 2009»
16 years 1 months ago
Distance-Based Representative Skyline
Given an integer k, a representative skyline contains the k skyline points that best describe the tradeoffs among different dimensions offered by the full skyline. Although this to...
Yufei Tao, Ling Ding, Xuemin Lin, Jian Pei
KDD
2005
ACM
92views Data Mining» more  KDD 2005»
16 years 9 days ago
Summarizing itemset patterns: a profile-based approach
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
Xifeng Yan, Hong Cheng, Jiawei Han, Dong Xin