Sciweavers

282 search results - page 26 / 57
» The Methods of Approximation and Lifting in Real Computation
Sort
View
ECCV
2002
Springer
16 years 7 months ago
Learning Shape from Defocus
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
Paolo Favaro, Stefano Soatto
ANOR
2010
130views more  ANOR 2010»
15 years 3 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
JCNS
2010
90views more  JCNS 2010»
15 years 22 days ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
AAAI
2008
15 years 8 months ago
Minimizing the Spread of Contamination by Blocking Links in a Network
We address the problem of minimizing the propagation of undesirable things, such as computer viruses or malicious rumors, by blocking a limited number of links in a network, a dua...
Masahiro Kimura, Kazumi Saito, Hiroshi Motoda
CSDA
2007
94views more  CSDA 2007»
15 years 5 months ago
Some extensions of score matching
Many probabilistic models are only defined up to a normalization constant. This makes maximum likelihood estimation of the model parameters very difficult. Typically, one then h...
Aapo Hyvärinen