Sciweavers

1478 search results - page 149 / 296
» Modular Complexity Analysis via Relative Complexity
Sort
View
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 3 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio
ICSE
2003
IEEE-ACM
14 years 2 months ago
A Tutorial on Feature Oriented Programming and Product-Lines
ct Feature Oriented Programming (FOP) is a design methodology and tools for program synthesis. The goal is to specify a target program in terms of the features that it offers, and ...
Don S. Batory
BMCBI
2008
123views more  BMCBI 2008»
13 years 9 months ago
A tree-based conservation scoring method for short linear motifs in multiple alignments of protein sequences
Background: The structure of many eukaryotic cell regulatory proteins is highly modular. They are assembled from globular domains, segments of natively disordered polypeptides and...
Claudia Chica, Alberto Labarga, Cathryn M. Gould, ...
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
14 years 2 months ago
Half-GCD and fast rational recovery
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
Daniel Lichtblau
ESANN
2007
13 years 10 months ago
Functional elements and networks in fMRI
Abstract. We propose a two-step approach for the analysis of functional magnetic resonance images, in the context of natural stimuli. In the first step, elements of functional bra...
Jarkko Ylipaavalniemi, Eerika Savia, Ricardo Vig&a...