Sciweavers

500 search results - page 29 / 100
» Coalgebraic semantics for timed processes
Sort
View
SEMWEB
2007
Springer
14 years 4 months ago
From Web Directories to Ontologies: Natural Language Processing Challenges
Hierarchical classifications are used pervasively by humans as a means to organize their data and knowledge about the world. One of their main advantages is that natural language ...
Ilya Zaihrayeu, Lei Sun, Fausto Giunchiglia, Wei P...
DEDS
2007
104views more  DEDS 2007»
13 years 9 months ago
Trellis Processes : A Compact Representation for Runs of Concurrent Systems
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
Eric Fabre
PVLDB
2010
98views more  PVLDB 2010»
13 years 8 months ago
On-the-Fly Entity-Aware Query Processing in the Presence of Linkage
Entity linkage is central to almost every data integration and data cleaning scenario. Traditional techniques use some computed similarity among data structure to perform merges a...
Ekaterini Ioannou, Wolfgang Nejdl, Claudia Nieder&...
FSEN
2009
Springer
14 years 4 months ago
A Timed Calculus for Wireless Systems
We propose a timed process calculus for wireless systems exposed to communication collisions. The operational semantics of our calculus is given in terms of a labelled transition ...
Massimo Merro, Eleonora Sibilio
SPAA
2009
ACM
14 years 7 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...