Sciweavers

1679 search results - page 32 / 336
» Strong order equivalence
Sort
View
CHES
2011
Springer
254views Cryptology» more  CHES 2011»
12 years 9 months ago
Extractors against Side-Channel Attacks: Weak or Strong?
Randomness extractors are important tools in cryptography. Their goal is to compress a high-entropy source into a more uniform output. Beyond their theoretical interest, they have ...
Marcel Medwed, François-Xavier Standaert
SIGMOD
2002
ACM
141views Database» more  SIGMOD 2002»
13 years 9 months ago
Bringing Order to Query Optimization
A variety of developments combine to highlight the need for respecting order when manipulating relations. For example, new functionality is being added to SQL to support OLAP-styl...
Giedrius Slivinskas, Christian S. Jensen, Richard ...
CCL
1994
Springer
14 years 2 months ago
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
Tomás E. Uribe, Mark E. Stickel
ENGL
2007
82views more  ENGL 2007»
13 years 9 months ago
Reduct Generation in Information Systems
— In any information system, the reducts are useful in classifying data. Janusz Starzyk developed an algorithm for computing reducts using strong equivalence and the law of expan...
G. Ganesan, D. Latha, C. Raghavendra Rao
WOLLIC
2009
Springer
14 years 4 months ago
Team Logic and Second-Order Logic
Team logic is a new logic, introduced by Väänänen [11], extending dependence logic by classical negation. Dependence logic adds to first-order logic atomic formulas expressing...
Juha Kontinen, Ville Nurmi