Sciweavers

2657 search results - page 513 / 532
» On the complexity of hierarchical problem solving
Sort
View
JOC
2000
181views more  JOC 2000»
13 years 9 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern
PVLDB
2008
146views more  PVLDB 2008»
13 years 8 months ago
Graceful database schema evolution: the PRISM workbench
Supporting graceful schema evolution represents an unsolved problem for traditional information systems that is further exacerbated in web information systems, such as Wikipedia a...
Carlo Curino, Hyun Jin Moon, Carlo Zaniolo
INFOCOM
2010
IEEE
13 years 7 months ago
Optimal SINR-based Random Access
— Random access protocols, such as Aloha, are commonly modeled in wireless ad-hoc networks by using the protocol model. However, it is well-known that the protocol model is not a...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong, Robe...
PAMI
2010
222views more  PAMI 2010»
13 years 7 months ago
Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
Leo Grady
ICFEM
2009
Springer
13 years 6 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...