Sciweavers

1002 search results - page 201 / 201
» Constraint Answer Set Solving
Sort
View
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 7 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
11 years 7 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...