Sciweavers

4934 search results - page 421 / 987
» complexity 2008
Sort
View
ECCV
2008
Springer
16 years 9 months ago
Feature Correspondence Via Graph Matching: Models and Global Optimization
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...
CORR
2008
Springer
117views Education» more  CORR 2008»
15 years 7 months ago
Robust Stochastic Chemical Reaction Networks and Bounded Tau-Leaping
The behavior of some stochastic chemical reaction networks is largely unaffected by slight inaccuracies in reaction rates. We formalize the robustness of state probabilities to re...
David Soloveichik
CISS
2008
IEEE
16 years 2 months ago
Resource allocation for cooperative relaying
—The delay-limited capacity of the half-duplex relay channel is analyzed for several cooperative protocols under a long-term average total transmit power constraint. It is assume...
Jie Yang, Deniz Gündüz, D. Richard Brown...
IPPS
2008
IEEE
16 years 2 months ago
Design of steering vectors for dynamically reconfigurable architectures
An architectural framework is studied that can perform dynamic reconfiguration. A basic objective is to dynamically reconfigure the architecture so that its configuration is well ...
Nick A. Mould, Brian F. Veale, John K. Antonio, Mo...
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 7 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard