1322 search results - page 141 / 265 » Parameterized counting problems |
101
click to vote
JCT
2011
14 years 9 months ago
2011
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
174
Voted
ICCV
1999
IEEE
16 years 3 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
120
Voted
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
We consider the problem of embedding arbitrary objects (e.g., images, audio, documents) into Euclidean space subject to a partial order over pairwise distances. Partial order cons...
97
Voted
HIPEAC
2010
Springer
15 years 11 months ago
2010
Springer
We address the problem of performance and power-efficient thread allocation in a CMP. To that end, based on analytical model, we introduce a parameterized performance/power metric ...
136
Voted
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
This paper introduces a semi-supervised distance metric learning algorithm which uses pair-wise equivalence (similarity and dissimilarity) constraints to improve the original dist...