Sciweavers

3405 search results - page 44 / 681
» Factoring Groups Efficiently
Sort
View
INFORMATICALT
2007
104views more  INFORMATICALT 2007»
13 years 8 months ago
Key Agreement Protocol (KAP) Using Conjugacy and Discrete Logarithm Problems in Group Representation Level
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...
Eligijus Sakalauskas, Povilas Tvarijonas, Andrius ...
PAMI
2002
78views more  PAMI 2002»
13 years 8 months ago
Robust Factorization
Factorization algorithms for recovering structure and motion from an image stream have many advantages, but they usually require a set of well tracked features. Such a set is in g...
Henrik Aanæs, Rune Fisker, Kalle Åstr&...
ICDE
2007
IEEE
151views Database» more  ICDE 2007»
14 years 10 months ago
Computing Compressed Multidimensional Skyline Cubes Efficiently
Recently, the skyline computation and analysis have been extended from one single full space to multidimensional subspaces, which can lead to valuable insights in some application...
Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Haixun Wang
BCSHCI
2008
13 years 10 months ago
Efficiency of multimodal metaphors in the presentation of learning information
The comparative study described in this paper has been conducted to investigate the effect of including multimodal metaphors on the usability of e-learning interfaces. Two indepen...
Marwan Alseid, Dimitrios Rigas
ECCV
2006
Springer
14 years 10 months ago
Controlling Sparseness in Non-negative Tensor Factorization
Non-negative tensor factorization (NTF) has recently been proposed as sparse and efficient image representation (Welling and Weber, Patt. Rec. Let., 2001). Until now, sparsity of t...
Matthias Heiler, Christoph Schnörr