Sciweavers

3937 search results - page 656 / 788
» Questioning Ubiquitous Computing
Sort
View
COCO
1989
Springer
97views Algorithms» more  COCO 1989»
14 years 1 days ago
On the Structure of Bounded Queries to Arbitrary NP Sets
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
Richard Chang
CCS
2007
ACM
13 years 12 months ago
Efficient policy analysis for administrative role based access control
Administrative RBAC (ARBAC) policies specify how Role-Based Access Control (RBAC) policies may be changed by each administrator. It is often difficult to fully understand the effe...
Scott D. Stoller, Ping Yang, C. R. Ramakrishnan, M...
CISSE
2007
Springer
13 years 12 months ago
Issues in Simulation for Valuing Long-Term Forwards
Abstract- This paper explores valuing long-term equity forwardcontracts or futures where both the underlying volatility and the interest rates are modeled as stochastic random vari...
Phillip G. Bradford, Alina Olteanu
APGV
2010
ACM
242views Visualization» more  APGV 2010»
13 years 12 months ago
The perception of finger motions
In this paper, we explore the perception of finger motions of virtual characters. In three experiments, designed to investigate finger animations, we asked the following questio...
Sophie Jörg, Jessica K. Hodgins, Carol O'Sull...
ARCS
2006
Springer
13 years 11 months ago
Minimising the Hardware Resources for a Cellular Automaton with Moving Creatures
: Given is the following "creature's exploration problem": n creatures are moving around in an unknown environment in order to visit all cells in shortest time. This...
Mathias Halbach, Rolf Hoffmann