Sciweavers

620 search results - page 84 / 124
» Likelihood Computations Using Value Abstraction
Sort
View
NEUROSCIENCE
2001
Springer
14 years 2 months ago
Biological Grounding of Recruitment Learning and Vicinal Algorithms in Long-Term Potentiation
Biological networks are capable of gradual learning based on observing a large number of exemplars over time as well as of rapidly memorizing specific events as a result of a sin...
Lokendra Shastri
EUROCRYPT
1999
Springer
14 years 2 months ago
Distributed Pseudo-random Functions and KDCs
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized su...
Moni Naor, Benny Pinkas, Omer Reingold
ICDM
2010
IEEE
160views Data Mining» more  ICDM 2010»
13 years 7 months ago
A Privacy Preserving Framework for Gaussian Mixture Models
Abstract--This paper presents a framework for privacypreserving Gaussian Mixture Model computations. Specifically, we consider a scenario where a central service wants to learn the...
Madhusudana Shashanka
CVPR
2010
IEEE
14 years 10 days ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai
RECOMB
2005
Springer
14 years 10 months ago
Improved Pattern-Driven Algorithms for Motif Finding in DNA Sequences
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
Sing-Hoi Sze, Xiaoyan Zhao