Sciweavers

392 search results - page 70 / 79
» Reversal Complexity Revisited
Sort
View
ESOP
2004
Springer
14 years 2 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn
PG
2003
IEEE
14 years 1 months ago
Breaking the Walls: Scene Partitioning and Portal Creation
In this paper we revisit the cells-and-portals visibility methods, originally developed for the special case of architectural interiors. We define an effectiveness measure for a ...
Alon Lerner, Yiorgos Chrysanthou, Daniel Cohen-Or
ASIACRYPT
2001
Springer
14 years 1 months ago
Fully Distributed Threshold RSA under Standard Assumptions
The aim of this article is to propose a fully distributed environment for the RSA scheme. What we have in mind is highly sensitive applications and even if we are ready to pay a pr...
Pierre-Alain Fouque, Jacques Stern
ER
2006
Springer
169views Database» more  ER 2006»
13 years 10 months ago
A More Expressive Softgoal Conceptualization for Quality Requirements Analysis
Initial software quality requirements tend to be imprecise, subjective, idealistic, and context-specific. An extended characterization of the common Softgoal concept is proposed fo...
Ivan Jureta, Stéphane Faulkner, Pierre-Yves...
CLEF
2008
Springer
13 years 10 months ago
Back to Basics - Again - for Domain-Specific Retrieval
In this paper we will describe Berkeley's approach to the Domain Specific (DS) track for CLEF 2008. Last year we used Entry Vocabulary Indexes and Thesaurus expansion approac...
Ray R. Larson