Sciweavers

3405 search results - page 33 / 681
» Factoring Groups Efficiently
Sort
View
AIPS
2006
13 years 10 months ago
Solving Factored MDPs with Exponential-Family Transition Models
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
EUROCRYPT
2008
Springer
13 years 10 months ago
Threshold RSA for Dynamic and Ad-Hoc Groups
Abstract--We consider the use of threshold signatures in adhoc and dynamic groups such as MANETs ("mobile ad-hoc networks"). We first show that known threshold RSA signat...
Rosario Gennaro, Shai Halevi, Hugo Krawczyk, Tal R...
HICSS
2008
IEEE
106views Biometrics» more  HICSS 2008»
14 years 2 months ago
An Empirical Investigation of the Roles of Outcome Controls and Psychological Factors in Collaboration Technology Supported Virt
The purpose of this research is to examine whether outcome controls of group work (i.e. time pressure and reward) trigger psychological factors (i.e. distraction, motivation, and ...
Fang He, Souren Paul
ICASSP
2010
IEEE
13 years 8 months ago
Multiplicative update rules for nonnegative matrix factorization with co-occurrence constraints
Nonnegative matrix factorization (NMF) is a widely-used tool for obtaining low-rank approximations of nonnegative data such as digital images, audio signals, textual data, financ...
Steven K. Tjoa, K. J. Ray Liu
GROUP
2010
ACM
13 years 6 months ago
Design, implementation, and evaluation of an approach for determining when programmers are having difficulty
Previous research has motivated the idea of automatically determining when programmers are having difficulty, provided an initial algorithm (unimplemented in an actual system), an...
Jason Carter, Prasun Dewan