Sciweavers

1516 search results - page 220 / 304
» On the Learnability of Vector Spaces
Sort
View
JCNS
2010
90views more  JCNS 2010»
14 years 4 months 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
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
14 years 1 months ago
Geometric surrogate-based optimisation for permutation-based problems
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon
CVPR
2012
IEEE
13 years 9 days ago
Exploiting local and global patch rarities for saliency detection
We introduce a saliency model based on two key ideas. The first one is considering local and global image patch rarities as two complementary processes. The second one is based o...
Ali Borji, Laurent Itti
ICCV
1999
IEEE
15 years 11 months ago
Segmentation using Eigenvectors: A Unifying View
Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using...
Yair Weiss
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
15 years 10 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin