Sciweavers

256 search results - page 41 / 52
» A practical comparison of two K-Means clustering algorithms
Sort
View
JSAC
2007
97views more  JSAC 2007»
14 years 9 months ago
R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
Mea Wang, Baochun Li
ICIP
1997
IEEE
15 years 11 months ago
Evaluation of Temporally Scalable Video Coding Techniques
Two temporally scalable video coding techniques, temporal subband coding (TSB) and predictive coding, are evaluated both theoretically and in practice to provide comparisons of co...
Gregory J. Conklin, Sheila S. Hemami
ISVLSI
2002
IEEE
104views VLSI» more  ISVLSI 2002»
15 years 2 months ago
Scalable VLSI Architecture for GF(p) Montgomery Modular Inverse Computation
Modular inverse computation is needed in several public key cryptographic applications. In this work, we present two VLSI hardware implementations used in the calculation of Montg...
Adnan Abdul-Aziz Gutub, Alexandre F. Tenca, &Ccedi...
DAC
1996
ACM
15 years 1 months ago
Modeling the Effects of Temporal Proximity of Input Transitions on Gate Propagation Delay and Transition Time
: While delay modeling of gates with a single switching input has received considerable attention, the case of multiple inputs switching in close temporal proximity is just beginni...
V. Chandramouli, Karem A. Sakallah
APWEB
2010
Springer
15 years 24 days ago
Computing Large Skylines over Few Dimensions: The Curse of Anti-correlation
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...
Henning Köhler, Jing Yang