Sciweavers

3284 search results - page 508 / 657
» On the modularity of feature interactions
Sort
View
KDD
2001
ACM
211views Data Mining» more  KDD 2001»
16 years 7 months ago
Magical thinking in data mining: lessons from CoIL challenge 2000
CoIL challenge 2000 was a supervised learning contest that attracted 43 entries. The authors of 29 entries later wrote explanations of their work. This paper discusses these repor...
Charles Elkan
POPL
2007
ACM
16 years 7 months ago
Types, bytes, and separation logic
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
Harvey Tuch, Gerwin Klein, Michael Norrish
POPL
2006
ACM
16 years 7 months ago
Frame rules from answer types for code pointers
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
Hayo Thielecke
RECOMB
2008
Springer
16 years 7 months ago
High-Resolution Modeling of Cellular Signaling Networks
A central challenge in systems biology is the reconstruction of biological networks from high-throughput data sets. A particularly difficult case of this is the inference of dynami...
Michael Baym, Chris Bakal, Norbert Perrimon, Bonni...
177
Voted
RECOMB
2001
Springer
16 years 7 months ago
Predicting the beta-helix fold from protein sequence data
A method is presented that uses b-strand interactions to predict the parallel right-handed b-helix super-secondary structural motif in protein sequences. A program called BetaWrap...
Phil Bradley, Lenore Cowen, Matthew Menke, Jonatha...