Sciweavers

745 search results - page 133 / 149
» A Formal Ontology for a Computational Approach of Time and A...
Sort
View
ICML
2004
IEEE
14 years 8 months ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye
PERCOM
2008
ACM
14 years 7 months ago
Structured decomposition of adaptive applications
We describe an approach to automate certain highlevel implementation decisions in a pervasive application, allowing them to be postponed until run time. Our system enables a model...
Justin Mazzola Paluska, Hubert Pham, Umar Saif, Gr...
CRYPTO
2009
Springer
109views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Randomizable Proofs and Delegatable Anonymous Credentials
We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other ...
Mira Belenkiy, Jan Camenisch, Melissa Chase, Marku...
KBSE
2007
IEEE
14 years 1 months ago
Adaptation hiding modularity
Growth in the complexity of computing systems, in the dynamism of the environments they operate in, and the need for timely adaptations as conditions change, now pose significant...
Yuanyuan Song
ATAL
2005
Springer
14 years 1 months ago
An online POMDP algorithm for complex multiagent environments
In this paper, we present an online method for POMDPs, called RTBSS (Real-Time Belief Space Search), which is based on a look-ahead search to find the best action to execute at e...
Sébastien Paquet, Ludovic Tobin, Brahim Cha...