9842 search results - page 458 / 1969 » The Complexity of the Matching-Cut Problem |
210
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
The goal of this paper consists in characterizing the capacity region of a broadcast system based on analog antenna combining and orthogonal frequency division multiplexing (OFDM)...
219
click to vote
ACL
2011
14 years 11 months ago
2011
We cast the word alignment problem as maximizing a submodular function under matroid constraints. Our framework is able to express complex interactions between alignment component...
214
click to vote
ICPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Model selection in unsupervised learning is a hard problem. In this paper a simple selection criterion for hyperparameters in one-class classifiers (OCCs) is proposed. It makes us...
167
click to vote
COCO
2001
Springer
15 years 12 months ago
2001
Springer
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
207
Voted
KBSE
1997
IEEE
15 years 11 months ago
1997
IEEE
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...