Sciweavers

206 search results - page 22 / 42
» On the numbers of variables to represent sparse logic functi...
Sort
View
IANDC
2006
102views more  IANDC 2006»
13 years 7 months ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
SIGSOFT
2006
ACM
14 years 8 months ago
Lightweight extraction of syntactic specifications
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
Mana Taghdiri, Robert Seater, Daniel Jackson
MP
2008
99views more  MP 2008»
13 years 7 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph
BMCBI
2007
112views more  BMCBI 2007»
13 years 7 months ago
Inferring biological functions and associated transcriptional regulators using gene set expression coherence analysis
Background: Gene clustering has been widely used to group genes with similar expression pattern in microarray data analysis. Subsequent enrichment analysis using predefined gene s...
Tae-Min Kim, Yeun-Jun Chung, Mun-Gan Rhyu, Myeong ...
TIT
2010
111views Education» more  TIT 2010»
13 years 2 months ago
Designing floating codes for expected performance
Floating codes are codes designed to store multiple values in a Write Asymmetric Memory, with applications to flash memory. In this model, a memory consists of a block of n cells, ...
Flavio Chierichetti, Hilary Finucane, Zhenming Liu...