Sciweavers

4894 search results - page 341 / 979
» Choices
Sort
View
ANTS
2010
Springer
262views Algorithms» more  ANTS 2010»
15 years 11 months ago
Short Bases of Lattices over Number Fields
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
Claus Fieker, Damien Stehlé
174
Voted
ACMIDC
2009
15 years 11 months ago
Designing for physical-digital correspondence in tangible learning environments
In tangible learning environments the potential to exploit different physical-digital links increases representational power but also broadens the complexity of design. This paper...
Sara Price, Taciana Pontual Falcão
PERCOM
2010
ACM
15 years 11 months ago
Decomposing power measurements for mobile devices
—Modern mobile phones are an appealing platform for pervasive computing applications. However, the complexity of these devices makes it difficult for developers to understand th...
Andrew Colin Rice, Simon Hay
EUROCRYPT
2007
Springer
15 years 11 months ago
Cryptanalysis of SFLASH with Slightly Modified Parameters
SFLASH is a signature scheme which belongs to a family of multivariate schemes proposed by Patarin et al. in 1998 [9]. The SFLASH scheme itself has been designed in 2001 [8] and ha...
Vivien Dubois, Pierre-Alain Fouque, Jacques Stern
219
Voted
EUROPAR
2007
Springer
15 years 11 months ago
On Using Incremental Profiling for the Performance Analysis of Shared Memory Parallel Applications
Abstract. Profiling is often the method of choice for performance analysis of parallel applications due to its low overhead and easily comprehensible results. However, a disadvanta...
Karl Fürlinger, Michael Gerndt, Jack Dongarra