9842 search results - page 1460 / 1969 » The Complexity of the Matching-Cut Problem |
187
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
173
click to vote
ICA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. This paper deals with the problem of estimating atrial activity during atrial fibrillation periods in the electrocardiogram (ECG). Since the signal of interest differs ...
182
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
208
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
173
click to vote
ICANN
2007
Springer
16 years 1 months ago
2007
Springer
The identification of cis-regulatory binding sites in DNA is a difficult problem in computational biology. To obtain a full understanding of the complex machinery embodied in genet...