Sciweavers

738 search results - page 77 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
COLT
2007
Springer
15 years 4 months ago
Learning Large-Alphabet and Analog Circuits with Value Injection Queries
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin
FOCI
2007
IEEE
15 years 4 months ago
A New Reduction from 3SAT to n-Partite Graphs
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
Daniel J. Hulme, Robin Hirsch, Bernard F. Buxton, ...
CCS
2008
ACM
14 years 11 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
BMCBI
2010
154views more  BMCBI 2010»
14 years 7 months ago
Knowledge-based matrix factorization temporally resolves the cellular responses to IL-6 stimulation
Background: External stimulations of cells by hormones, cytokines or growth factors activate signal transduction pathways that subsequently induce a re-arrangement of cellular gen...
Andreas Kowarsch, Florian Blöchl, Sebastian B...
NIPS
2003
14 years 11 months ago
Increase Information Transfer Rates in BCI by CSP Extension to Multi-class
Brain-Computer Interfaces (BCI) are an interesting emerging technology that is driven by the motivation to develop an effective communication interface translating human intention...
Guido Dornhege, Benjamin Blankertz, Gabriel Curio,...