Sciweavers

780 search results - page 141 / 156
» Inverse Probleme
Sort
View
IPPS
2008
IEEE
14 years 2 months ago
Modeling and predicting application performance on parallel computers using HPC challenge benchmarks
A method is presented for modeling application performance on parallel computers in terms of the performance of microkernels from the HPC Challenge benchmarks. Specifically, the a...
Wayne Pfeiffer, Nicholas J. Wright
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
ISWC
2006
IEEE
14 years 1 months ago
Discovering Characteristic Actions from On-Body Sensor Data
We present an approach to activity discovery, the unsupervised identification and modeling of human actions embedded in a larger sensor stream. Activity discovery can be seen as ...
David Minnen, Thad Starner, Irfan A. Essa, Charles...
CVPR
2006
IEEE
14 years 9 months ago
Clustering Appearance for Scene Analysis
We propose a new approach called "appearance clustering" for scene analysis. The key idea in this approach is that the scene points can be clustered according to their s...
Sanjeev J. Koppal, Srinivasa G. Narasimhan
ASIACRYPT
2007
Springer
14 years 1 months ago
When e-th Roots Become Easier Than Factoring
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
Antoine Joux, David Naccache, Emmanuel Thomé...