Sciweavers

917 search results - page 26 / 184
» The Generalized Trace-Norm and its Application to Structure-...
Sort
View
SAT
2009
Springer
82views Hardware» more  SAT 2009»
15 years 4 months ago
Generalizing Core-Guided Max-SAT
Recent work has shown the value of using unsatisfiable cores to guide maximum satisfiability algorithms (Max-SAT) running on industrial instances [5,9,10,11]. We take this concep...
Mark H. Liffiton, Karem A. Sakallah
100
Voted
JIPS
2010
165views more  JIPS 2010»
14 years 4 months ago
IMTAR: Incremental Mining of General Temporal Association Rules
Nowadays due to the rapid advances in the field of information systems, transactional databases are being updated regularly and/or periodically. The knowledge discovered from these...
Anour F. A. Dafa-Alla, Ho-Sun Shon, Khalid E. K. S...
94
Voted
AAAI
2008
14 years 12 months ago
Clause Learning Can Effectively P-Simulate General Propositional Resolution
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, A...
63
Voted
EUROCRYPT
2009
Springer
15 years 10 months ago
On the Portability of Generalized Schnorr Proofs
The notion of Zero Knowledge Proofs (of knowledge) [ZKP] is central to cryptography; it provides a set of security properties that proved indispensable in concrete protocol design...
Jan Camenisch, Aggelos Kiayias, Moti Yung
ICFEM
2000
Springer
15 years 1 months ago
Formal Treatment of a Family of Fixed-Point Problems on Graphs by CafeOBJ
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
Tetsuo Tamai