Sciweavers

1763 search results - page 148 / 353
» A Formalization of Polytime Functions
Sort
View
ML
2007
ACM
101views Machine Learning» more  ML 2007»
14 years 9 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
ISOLA
2010
Springer
14 years 8 months ago
Ten Years of Performance Evaluation for Concurrent Systems Using CADP
This article comprehensively surveys the work accomplished during the past decade on an approach to analyze concurrent systems qualitatively and quantitatively, by combining functi...
Nicolas Coste, Hubert Garavel, Holger Hermanns, Fr...
109
Voted
ASIACRYPT
2010
Springer
14 years 8 months ago
Random Oracles with(out) Programmability
This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ide...
Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Th...
COSIT
2009
Springer
211views GIS» more  COSIT 2009»
14 years 8 months ago
The Abduction of Geographic Information Science: Transporting Spatial Reasoning to the Realm of Purpose and Design
People intuitively understand that function and purpose are critical parts of what human-configured entities are about, but these notions have proved difficult to capture formally....
Helen Couclelis
CI
2000
114views more  CI 2000»
14 years 10 months ago
A Guided Tour through Some Extensions of the Event Calculus
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...