Sciweavers

1131 search results - page 206 / 227
» Logic Programming, Functional Programming, and Inductive Def...
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Learning nonparametric kernel matrices from pairwise constraints
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu
ACMSE
2009
ACM
14 years 1 months ago
Ginger: implementing a new Lisp family syntax
In this paper we introduce G-expressions, a new syntax based on the S-expression syntax utilized by most Lisp family languages. We have implemented a new homoiconic language, Ging...
James Dean Palmer
ECRTS
2004
IEEE
13 years 11 months ago
TLSF: A New Dynamic Memory Allocator for Real-Time Systems
Dynamic storage allocation (DSA) algorithms play an important role in the modern software engineering paradigms and techniques (such as object oriented programming). Using DSA inc...
Miguel Masmano, Ismael Ripoll, Alfons Crespo, Jorg...
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
13 years 11 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...
ASIACRYPT
2008
Springer
13 years 9 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...