3946 search results - page 266 / 790 » The computational complexity of choice sets |
200
click to vote
RECOMB
2004
Springer
16 years 7 months ago
2004
Springer
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
193
click to vote
GECCO
2007
Springer
16 years 27 days ago
2007
Springer
We attack the problem of user fatigue by using an interactive genetic algorithm to evolve user interfaces in the XUL interface definition language. The interactive genetic algori...
223
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Spectral clustering and eigenvector-based methods have become increasingly popular in segmentation and recognition. Although the choice of the pairwise similarity metric (or affin...
173
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
196
click to vote
SIAMJO
2008
15 years 6 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...