Sciweavers

3897 search results - page 297 / 780
» complexity 2010
Sort
View
AFRICACRYPT
2010
Springer
16 years 1 months ago
Avoiding Full Extension Field Arithmetic in Pairing Computations
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
Craig Costello, Colin Boyd, Juan Manuel Gonz&aacut...
CTRSA
2010
Springer
189views Cryptology» more  CTRSA 2010»
16 years 1 months ago
Linear Cryptanalysis of Reduced-Round PRESENT
Abstract. PRESENT is a hardware-oriented block cipher suitable for resource constrained environment. In this paper we analyze PRESENT by the multidimensional linear cryptanalysis m...
Joo Yeon Cho
ECCV
2010
Springer
15 years 12 months ago
Fast Multi-Aspect 2D Human Detection
Abstract. We address the problem of detecting human figures in images, taking into account that the image of the human figure may be taken from a range of viewpoints. We capture ...
COMPGEOM
2010
ACM
15 years 11 months ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...
EICS
2010
ACM
15 years 11 months ago
Self-explanatory user interfaces by model-driven engineering
Modern User Interfaces (UI) must deal with the increasing complexity of applications as well as new features such as the capacity of UIs to be dynamically adapted to the context o...
Alfonso García Frey