Sciweavers

1326 search results - page 247 / 266
» Adaptable Similarity Search using Non-Relevant Information
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 11 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
ICML
2002
IEEE
14 years 8 months ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...
BMCBI
2010
112views more  BMCBI 2010»
13 years 7 months ago
In silico fragmentation for computer assisted identification of metabolite mass spectra
Background: Mass spectrometry has become the analytical method of choice in metabolomics research. The identification of unknown compounds is the main bottleneck. In addition to t...
Sebastian Wolf, Stephan Schmidt, Matthias Mül...
BMCBI
2007
169views more  BMCBI 2007»
13 years 7 months ago
The CRISPRdb database and tools to display CRISPRs and to generate dictionaries of spacers and repeats
Background: In Archeae and Bacteria, the repeated elements called CRISPRs for "clustered regularly interspaced short palindromic repeats" are believed to participate in ...
Ibtissem Grissa, Gilles Vergnaud, Christine Pource...
AIPS
2010
13 years 7 months ago
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Sc...
Malte Helmert, Hauke Lasinger