Sciweavers

1677 search results - page 83 / 336
» On the Completeness of Quantum Computation Models
Sort
View
MOBIQUITOUS
2005
IEEE
15 years 7 months ago
An ECA-P Policy-based Framework for Managing Ubiquitous Computing Environments
Ubiquitous Computing Environments feature massively distributed systems containing a large number of devices, services and applications that help end-users perform various kinds o...
Chetan Shiva Shankar, Anand Ranganathan, Roy H. Ca...
SAC
2006
ACM
15 years 7 months ago
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
Michael Orshansky, Wei-Shen Wang, Martine Ceberio,...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 7 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
CONCUR
2009
Springer
15 years 8 months ago
Model-Checking Games for Fixpoint Logics with Partial Order Models
Abstract. We introduce model-checking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played....
Julian Gutierrez, Julian C. Bradfield
ICCV
2007
IEEE
16 years 3 months ago
Correspondence labelling for wide-timeframe free-form surface matching
This paper addresses the problem of estimating dense correspondence between arbitrary frames from captured sequences of shape and appearance for surfaces undergoing free-form defo...
Jonathan Starck, Adrian Hilton