Sciweavers

16430 search results - page 677 / 3286
» On Computable Tree Functions
Sort
View
TNN
2010
216views Management» more  TNN 2010»
15 years 1 months ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
EUROCRYPT
2011
Springer
14 years 10 months ago
Homomorphic Signatures for Polynomial Functions
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
Dan Boneh, David Mandell Freeman
193
Voted
FOCS
2007
IEEE
16 years 1 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
CVPR
2006
IEEE
16 years 9 months ago
BoostMotion: Boosting a Discriminative Similarity Function for Motion Estimation
Motion estimation for applications where appearance undergoes complex changes is challenging due to lack of an appropriate similarity function. In this paper, we propose to learn ...
Shaohua Kevin Zhou, Bogdan Georgescu, Dorin Comani...
BMCBI
2010
112views more  BMCBI 2010»
15 years 7 months ago
Orientation-dependent backbone-only residue pair scoring functions for fixed backbone protein design
Background: Empirical scoring functions have proven useful in protein structure modeling. Most such scoring functions depend on protein side chain conformations. However, backbone...
Andrew J. Bordner