1002 search results - page 201 / 201 » Constraint Answer Set Solving |
SODA
2012
ACM
13 years 23 hour ago
2012
ACM
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...
117
click to vote
SDM
2012
SIAM
13 years 15 min ago
2012
SIAM
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...