Sciweavers

2200 search results - page 214 / 440
» The Generalized Pignistic Transformation
Sort
View
PKDD
1998
Springer
123views Data Mining» more  PKDD 1998»
15 years 5 months ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
Jean-François Boulicaut, Mika Klemettinen, ...
102
Voted
ICFP
1997
ACM
15 years 5 months ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves
CRYPTO
1994
Springer
98views Cryptology» more  CRYPTO 1994»
15 years 4 months ago
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
Ronald Cramer, Ivan Damgård, Berry Schoenmak...
111
Voted
ASPLOS
1992
ACM
15 years 4 months ago
Access Normalization: Loop Restructuring for NUMA Compilers
: In scalable parallel machines, processors can make local memory accesses much faster than they can make remote memory accesses. In addition, when a number of remote accesses must...
Wei Li, Keshav Pingali
116
Voted
EUROPAR
2007
Springer
15 years 4 months ago
Domain-Specific Optimization Strategy for Skeleton Programs
Skeletal parallel programming enables us to develop parallel programs easily by composing ready-made components called skeletons. However, a simplycomposed skeleton program often l...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...