Sciweavers

503 search results - page 84 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
98
Voted
SPAA
2009
ACM
15 years 6 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
STACS
2009
Springer
15 years 4 months ago
The Dynamic Complexity of Formal Languages
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
Wouter Gelade, Marcel Marquardt, Thomas Schwentick
LICS
2007
IEEE
15 years 4 months ago
A computable approach to measure and integration theory
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...
Abbas Edalat
69
Voted
ICIP
2010
IEEE
14 years 7 months ago
Randomly driven fuzzy key extraction of unclonable images
In this paper, we develop an adjustable Fuzzy Extractor using the Physical Unclonable Functions (PUF) obtained by a common laser engraving method to sign physical objects. In part...
Saloomeh Shariati, Laurent Jacques, Françoi...
BMCBI
2010
83views more  BMCBI 2010»
14 years 9 months ago
Trees on networks: resolving statistical patterns of phylogenetic similarities among interacting proteins
Background: Phylogenies capture the evolutionary ancestry linking extant species. Correlations and similarities among a set of species are mediated by and need to be understood in...
William P. Kelly, Michael P. H. Stumpf