Sciweavers

3318 search results - page 367 / 664
» The Weak Instance Model
Sort
View
AB
2007
Springer
15 years 10 months ago
Analyzing Pathways Using SAT-Based Approaches
Abstract. A network of reactions is a commonly used paradigm for representing knowledge about a biological process. How does one understand such generic networks and answer queries...
Ashish Tiwari, Carolyn L. Talcott, Merrill Knapp, ...
PKC
2007
Springer
144views Cryptology» more  PKC 2007»
15 years 10 months ago
Traceable Ring Signature
Abstract. The ring signature allows a signer to leak secrets anonymously, without the risk of identity escrow. At the same time, the ring signature provides great flexibility: No ...
Eiichiro Fujisaki, Koutarou Suzuki
CCECE
2006
IEEE
15 years 10 months ago
FPGA-Based SAT Solver
Several approaches have been proposed to accelerate the NP-complete Boolean Satisfiability problem (SAT) using reconfigurable computing. We present an FPGA based clause evaluator,...
Mona Safar, M. Watheq El-Kharashi, Ashraf Salem
ICDE
2006
IEEE
115views Database» more  ICDE 2006»
15 years 10 months ago
Integration Workbench: Integrating Schema Integration Tools
A key aspect of any data integration endeavor is establishing a transformation that translates instances of one or more source schemata into instances of a target schema. This sch...
Peter Mork, Arnon Rosenthal, Leonard J. Seligman, ...
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 10 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk