Sciweavers

1999 search results - page 79 / 400
» Finding Reductions Automatically
Sort
View
TPDS
1998
114views more  TPDS 1998»
14 years 9 months ago
On the Automatic Parallelization of the Perfect Benchmarks
We present a set of advanced program parallelization techniques that are able to signi cantly improve the performance of application programs. We present evidence for this improve...
Rudolf Eigenmann, Jay Hoeflinger, David A. Padua
ICML
2005
IEEE
15 years 10 months ago
Action respecting embedding
Dimensionality reduction is the problem of finding a low-dimensional representation of highdimensional input data. This paper examines the case where additional information is kno...
Michael H. Bowling, Ali Ghodsi, Dana F. Wilkinson
EUROCRYPT
2010
Springer
14 years 10 months ago
On the Impossibility of Three-Move Blind Signature Schemes
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...
Marc Fischlin, Dominique Schröder
TSMC
2010
14 years 4 months ago
Incomplete Multigranulation Rough Set
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...
Yuhua Qian, Jiye Liang, Chuangyin Dang
CCS
2006
ACM
15 years 1 months ago
EXE: automatically generating inputs of death
This paper presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input,...
Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, ...