Sciweavers

1391 search results - page 68 / 279
» Complexity Limitations on Quantum Computation
Sort
View
CORR
2006
Springer
132views Education» more  CORR 2006»
13 years 7 months ago
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. ...
TC
2008
13 years 7 months ago
Computationally Efficient PKI-Based Single Sign-On Protocol, PKASSO for Mobile Devices
In an attempt to expand Public Key Infrastructure (PKI) usage to a ubiquitous and mobile computing environment, we found that the deployment of the PKI on a resource-constrained de...
Ki-Woong Park, Sang Seok Lim, Kyu Ho Park
CSFW
2008
IEEE
14 years 2 months ago
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
Ralf Küsters, Max Tuengerthal
BC
2005
127views more  BC 2005»
13 years 7 months ago
Computational modeling and exploration of contour integration for visual saliency
Abstract Weproposeacomputationalmodelofcontourintegration for visual saliency. The model uses biologically plausible devices to simulate how the representations of elements aligned...
T. Nathan Mundhenk, Laurent Itti
CCECE
2006
IEEE
14 years 1 months ago
XPHEVE: An Extensible Physics Engine for Virtual Environments
Virtual Reality (VR) has gained more popularity in the recent years due to the advancements in hardware technology, an advancement that eliminated much of the limitations that VR ...
Saeid Nourian, Xiaojun Shen, Nicolas D. Georganas