Sciweavers

17 search results - page 3 / 4
» Performances of Galois Sub-hierarchy-building Algorithms
Sort
View
ASPLOS
2008
ACM
13 years 7 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...
ICA
2007
Springer
13 years 12 months ago
ICA in Boolean XOR Mixtures
We consider Independent Component Analysis (ICA) for the case of binary sources, where addition has the meaning of the boolean “Exclusive Or” (XOR) operation. Thus, each mixtur...
Arie Yeredor
IPPS
2007
IEEE
14 years 1 days ago
Scheduling Issues in Optimistic Parallelization
Irregular applications, which rely on pointer-based data structures, are often difficult to parallelize. The inputdependent nature of their execution means that traditional paral...
Milind Kulkarni, Keshav Pingali
IJNSEC
2006
94views more  IJNSEC 2006»
13 years 5 months ago
A Binary Redundant Scalar Point Multiplication in Secure Elliptic Curve Cryptosystems
The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication which is ...
Sangook Moon
AIIA
2005
Springer
13 years 11 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut