Sciweavers

1088 search results - page 15 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
ICIP
2007
IEEE
15 years 11 months ago
Nonstationary Blind Image Restoration using Variational Methods
The Variational Bayesian approach has recently been proposed to tackle the blind image restoration (BIR) problem. We consider extending the procedures to include realistic boundar...
Tom E. Bishop, Rafael Molina, James R. Hopgood
82
Voted
STACS
2009
Springer
15 years 4 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
ICS
2010
Tsinghua U.
15 years 6 months ago
On the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
Noam Livne
ECCB
2003
IEEE
15 years 2 months ago
Gene networks inference using dynamic Bayesian networks
This article deals with the identification of gene regulatory networks from experimental data using a statistical machine learning approach. A stochastic model of gene interactio...
Bruno-Edouard Perrin, Liva Ralaivola, Aurél...
CPAIOR
2010
Springer
15 years 2 months ago
A Constraint Programming Approach for the Service Consolidation Problem
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...
Kanika Dhyani, Stefano Gualandi, Paolo Cremonesi