Sciweavers

254 search results - page 25 / 51
» On the randomized solution of initial value problems
Sort
View
SIAMDM
2010
131views more  SIAMDM 2010»
14 years 6 months ago
On Optimal Strategies for a Hat Game on Graphs
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
Uriel Feige
ICIP
2010
IEEE
14 years 9 months ago
Bayesian regularization of diffusion tensor images using hierarchical MCMC and loopy belief propagation
Based on the theory of Markov Random Fields, a Bayesian regularization model for diffusion tensor images (DTI) is proposed in this paper. The low-degree parameterization of diffus...
Siming Wei, Jing Hua, Jiajun Bu, Chun Chen, Yizhou...
ALMOB
2006
155views more  ALMOB 2006»
14 years 12 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...
DAGSTUHL
2006
15 years 1 months ago
Probabilistically Stable Numerical Sparse Polynomial Interpolation
We consider the problem of sparse interpolation of a multivariate black-box polynomial in floating-point arithmetic. That is, both the inputs and outputs of the black-box polynomia...
Mark Giesbrecht, George Labahn, Wen-shin Lee
COR
2008
99views more  COR 2008»
14 years 12 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi