Sciweavers

2173 search results - page 5 / 435
» On the Values of Reducibility Candidates
Sort
View
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
13 years 11 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
MICRO
2000
IEEE
61views Hardware» more  MICRO 2000»
13 years 11 months ago
Reducing wire delay penalty through value prediction
In this work we show that value prediction can be used to avoid the penalty of long wire delays by predicting the data that is communicated through these long wires and validating...
Joan-Manuel Parcerisa, Antonio González
AINA
2007
IEEE
14 years 1 months ago
Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values
The multiparty multiplication of two polynomially shared values over Zq with a public prime number q is an important module in distributed computations. The multiplication protoco...
Peter Lory
GLVLSI
2009
IEEE
113views VLSI» more  GLVLSI 2009»
13 years 11 months ago
Reducing parity generation latency through input value aware circuits
1 Soft errors caused by cosmic particles and radiation emitted by the packaging are an important problem in contemporary microprocessors. Parity bits are used to detect single bit ...
Yusuf Osmanlioglu, Y. Onur Koçberber, Oguz ...