874 search results - page 132 / 175 » Computing Weighted Solutions in Answer Set Programming |
139
click to vote
CCR
2002
15 years 2 months ago
2002
Most network protocols are uni-modal: they employ a single set of algorithms that allows them to cope well only within a narrow range of operating conditions. This rigid design re...
103
Voted
NIPS
2008
15 years 4 months ago
2008
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
151
click to vote
KES
2008
Springer
15 years 2 months ago
2008
Springer
Evolutionary techniques provide powerful tools to design novel solutions for hard problems in different areas. However, the problem of scale (i.e. how to create a large, complex s...
139
Voted
JMLR
2012
13 years 5 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
124
click to vote
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...