Sciweavers

876 search results - page 37 / 176
» A theory of learning with similarity functions
Sort
View
ICML
2004
IEEE
16 years 17 days ago
Unifying collaborative and content-based filtering
Collaborative and content-based filtering are two paradigms that have been applied in the context of recommender systems and user preference prediction. This paper proposes a nove...
Justin Basilico, Thomas Hofmann
MYCRYPT
2005
Springer
248views Cryptology» more  MYCRYPT 2005»
15 years 5 months ago
A Family of Fast Syndrome Based Cryptographic Hash Functions
Recently, some collisions have been exposed for a variety of cryptographic hash functions [20,21] including some of the most widely used today. Many other hash functions using simi...
Daniel Augot, Matthieu Finiasz, Nicolas Sendrier
ICFP
2012
ACM
13 years 2 months ago
Transporting functions across ornaments
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
Pierre-Évariste Dagand, Conor McBride
COMPGEOM
2011
ACM
14 years 3 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
ALDT
2009
Springer
140views Algorithms» more  ALDT 2009»
15 years 6 months ago
Directional Decomposition of Multiattribute Utility Functions
Abstract. Several schemes have been proposed for compactly representing multiattribute utility functions, yet none seems to achieve the level of success achieved by Bayesian and Ma...
Ronen I. Brafman, Yagil Engel