533 search results - page 98 / 107 » The Computational Complexity of Sensitivity Analysis and Par... |
STOC
2005
ACM
15 years 12 months ago
2005
ACM
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
131
click to vote
GECCO
2008
Springer
15 years 21 days ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
ACCV
2007
Springer
15 years 5 months ago
2007
Springer
In this paper, we take a predefined geometry shape as a constraint for accurate shape alignment. A shape model is divided in two parts: fixed shape and active shape. The fixed shap...
101
click to vote
SAMOS
2009
Springer
15 years 4 months ago
2009
Springer
The demands for high quality, real-time performance and multi-format video support in consumer multimedia products are ever increasing. In particular, the future multimedia systems...
BMCBI
2007
2007
Missing channels in two-colour microarray experiments: Combining single-channel and two-channel data
14 years 11 months ago
Background: There are mechanisms, notably ozone degradation, that can damage a single channel of two-channel microarray experiments. Resulting analyses therefore often choose betw...