Sciweavers

271 search results - page 29 / 55
» Logics from Galois connections
Sort
View
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 10 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
CONCUR
2005
Springer
14 years 3 months ago
Type-Directed Concurrency
Abstract. We introduce a novel way to integrate functional and concurrent programming based on intuitionistic linear logic. The functional core arises from interpreting proof reduc...
Deepak Garg, Frank Pfenning
BCB
2010
127views Bioinformatics» more  BCB 2010»
13 years 4 months ago
A novel network model for molecular prognosis
Network-based genome-wide association studies (NWAS) utilize the molecular interactions between genes and functional pathways in biomarker identification. This study presents a no...
Ying-Wooi Wan, Swetha Bose, James Denvir, Nancy La...
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 10 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
AEI
1999
120views more  AEI 1999»
13 years 9 months ago
Genetic algorithms for designing multihop lightwave network topologies
Multihop lightwave networks are a means of utilizing the large bandwidth of optical fibers. In these networks, each node has a fixed number of transmitters and receivers connected...
Cenk Gazen, Cem Ersoy