Sciweavers

1830 search results - page 61 / 366
» Functional Programs as Linked Data
Sort
View
CACM
2000
130views more  CACM 2000»
15 years 2 months ago
Visual Generalization in Programming by Example
In Programming by Example [PBE, also sometimes called "Programming by Demonstration"] systems, the system records actions performed by a user in the interface, and produ...
Robert St. Amant, Henry Lieberman, Richard Potter,...
WOLLIC
2010
Springer
15 years 8 months ago
On the Role of the Complementation Rule for Data Dependencies over Incomplete Relations
Recently, an axiomatization for functional dependencies (FDs) and multivalued dependencies (MVDs) has been established where arbitrary attributes can be specified as NOT NULL. Tha...
Flavio Ferrarotti, Sven Hartmann, Sebastian Link
RECOMB
2005
Springer
16 years 3 months ago
Modeling the Combinatorial Functions of Multiple Transcription Factors
A considerable fraction of yeast gene promoters are bound by multiple transcription factors. To study the combinatorial interactions of multiple transcription factors is thus impor...
Chen-Hsiang Yeang, Tommi Jaakkola
GECCO
2000
Springer
123views Optimization» more  GECCO 2000»
15 years 6 months ago
Genomic computing: explanatory modelling for functional genomics
Many newly discovered genes are of unknown function. DNA microarrays are a method for determining the expression levels of all genes in an organism for which a complete genome seq...
Richard J. Gilbert, Jem J. Rowland, Douglas B. Kel...
WCFLP
2005
ACM
15 years 8 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal