Sciweavers

1453 search results - page 130 / 291
» Partial Constraint Satisfaction
Sort
View
ISBI
2007
IEEE
15 years 10 months ago
Fast Regularized Reconstruction of Non-Uniformly Subsampled Partial-Fourier Parallel MRI Data
We present an adaptation of our previous fast, regularized parallel MRI reconstruction approach (LSQR-Hybrid) to encompass the reconstruction of partial-Fourier data. Reconstructi...
William Scott Hoge, Misha Elena Kilmer, Carlos Zac...
CADE
2004
Springer
15 years 9 months ago
Modular Proof Systems for Partial Functions with Weak Equality
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
Harald Ganzinger, Viorica Sofronie-Stokkermans, Uw...
UM
2009
Springer
15 years 9 months ago
History Dependent Recommender Systems Based on Partial Matching
Abstract. This paper focuses on the utilization of the history of navigation within recommender systems. It aims at designing a collaborative recommender based on Markov models rel...
Armelle Brun, Geoffray Bonnin, Anne Boyer
JSAC
2008
141views more  JSAC 2008»
15 years 3 months ago
On cooperative source transmission with partial rate and power control
The problem of transmitting a Gaussian source over a half-duplex fading relay channel with limited channel state feedback is studied. It is shown that under a short-term power cons...
Thanh Tùng Kim, Mikael Skoglund, Giuseppe C...
FOCS
2007
IEEE
15 years 10 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx