Sciweavers

34 search results - page 3 / 7
» The Computational Hardness of Estimating Edit Distance
Sort
View
WPES
2003
ACM
14 years 21 days ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...
BMCBI
2006
143views more  BMCBI 2006»
13 years 7 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
13 years 8 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
ICML
2010
IEEE
13 years 8 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
TASLP
2008
176views more  TASLP 2008»
13 years 7 months ago
Analysis of Minimum Distances in High-Dimensional Musical Spaces
Abstract--We propose an automatic method for measuring content-based music similarity, enhancing the current generation of music search engines and recommender systems. Many previo...
Michael Casey, Christophe Rhodes, Malcolm Slaney