1182 search results - page 99 / 237 » Iterative Methods in Combinatorial Optimization |
109
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We provide two compressive sensing (CS) recovery algorithms based on iterative hard-thresholding. The algorithms, collectively dubbed as algebraic pursuits (ALPS), exploit the res...
116
click to vote
AAAI
2010
15 years 4 months ago
2010
The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...
114
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
114
click to vote
SCALESPACE
2009
Springer
15 years 9 months ago
2009
Springer
Multi-class labeling is one of the core problems in image analysis. We show how this combinatorial problem can be approximately solved using tools from convex optimization. We sugg...
152
click to vote
PAKDD
2007
ACM
15 years 9 months ago
2007
ACM
In this study, we propose a novel evolutionary algorithm-based clustering method, named density-sensitive evolutionary clustering (DSEC). In DSEC, each individual is a sequence of ...