Sciweavers

5904 search results - page 502 / 1181
» Requirements for a Composition Language
Sort
View
BMCBI
2004
113views more  BMCBI 2004»
15 years 7 months ago
Oligo kernels for datamining on biological sequences: a case study on prokaryotic translation initiation sites
Background: Kernel-based learning algorithms are among the most advanced machine learning methods and have been successfully applied to a variety of sequence classification tasks ...
Peter Meinicke, Maike Tech, Burkhard Morgenstern, ...
JAPLL
2007
104views more  JAPLL 2007»
15 years 6 months ago
An axiomatization of family resemblance
We invoke concepts from the theory of hypergraphs to give a measure of the closeness of family resemblance, and to make precise the idea of a composite likeness. It is shown that f...
Ray E. Jennings, Dorian X. Nicholson
ASIACRYPT
2011
Springer
14 years 7 months ago
BiTR: Built-in Tamper Resilience
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
Seung Geol Choi, Aggelos Kiayias, Tal Malkin
OOPSLA
2004
Springer
16 years 15 days ago
Practical predicate dispatch
Predicate dispatch is an object-oriented (OO) language mechanism for determining the method implementation to be invoked upon a message send. With predicate dispatch, each method ...
Todd D. Millstein
OOPSLA
2010
Springer
15 years 5 months ago
Managing ambiguity in programming by finding unambiguous examples
We propose a new way to raise the level of discourse in the programming process: permit ambiguity, but manage it by linking it to unambiguous examples. This allows programming env...
Kenneth C. Arnold, Henry Lieberman