Sciweavers

130 search results - page 16 / 26
» Generalized Correlation Analysis of Vectorial Boolean Functi...
Sort
View
DAM
1999
100views more  DAM 1999»
13 years 7 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
STACS
2010
Springer
14 years 2 months ago
Evasiveness and the Distribution of Prime Numbers
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
László Babai, Anandam Banerjee, Ragh...
TMC
2010
137views more  TMC 2010»
13 years 5 months ago
A Metric for DISH Networks: Analysis, Implications, and Applications
—In wireless networks, node cooperation has been exploited as a data relaying mechanism for decades. However, the wireless channel allows for much richer interaction among nodes....
Tie Luo, Vikram Srinivasan, Mehul Motani
ISPD
2004
ACM
161views Hardware» more  ISPD 2004»
14 years 29 days ago
Early-stage power grid analysis for uncertain working modes
High performance integrated circuits are now reaching the 100-plus watt regime, and power delivery and power grid signal integrity have become critical. Analyzing the performance ...
Haifeng Qian, Sani R. Nassif, Sachin S. Sapatnekar
EKAW
2004
Springer
14 years 28 days ago
Managing Patient Record Instances Using DL-Enabled Formal Concept Analysis
Abstract In this paper we describe a general logic-enabled Formal Concept Analysis (FCA) approach to manage patient record instances. In particular, the conceptual model of the dom...
Bo Hu, Srinandan Dasmahapatra, David Dupplaw, Paul...