1629 search results - page 113 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
158
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
In this paper, we present a new approach to the problem of inverter elimination in domino logic synthesis. A small piece of static CMOS logic is introduced to the circuit to avoid...
110
click to vote
DAC
1998
ACM
15 years 2 months ago
1998
ACM
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...
ICPP
2007
IEEE
15 years 4 months ago
2007
IEEE
High performance clusters have been widely used to provide amazing computing capability for both commercial and scientific applications. However, huge power consumption has preven...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The premise of automated alert correlation is to accept that false alerts from a low level intrusion detection system are inevitable and use attack models to explain the output in ...