Sciweavers

1791 search results - page 236 / 359
» Semantics and Complexity of SPARQL
Sort
View
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
15 years 5 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
BDA
2007
15 years 6 months ago
Hyperplane Queries in a Feature-Space M-tree for Speeding up Active Learning
In content-based retrieval, relevance feedback (RF) is a noticeable method for reducing the “semantic gap” between the low-level features describing the content and the usually...
Michel Crucianu, Daniel Estevez, Vincent Oria, Jea...
ENTCS
2010
82views more  ENTCS 2010»
15 years 4 months ago
A Strict-Observational Interface Theory for Analysing Service Orchestrations
Service oriented computing is an accepted architectural style for developing large, distributed software systems. A particular promise of such architectures is service orchestrati...
Philip Mayer, Andreas Schroeder, Sebastian S. Baue...
DSS
2006
93views more  DSS 2006»
15 years 4 months ago
Merging workflows: A new perspective on connecting business processes
This paper describes the concept of workflow merge and methods for merging business processes. We grouped merges in four categories according to the type of merge: sequential, par...
Shuang Sun, Akhil Kumar, John Yen
ENTCS
2006
120views more  ENTCS 2006»
15 years 4 months ago
Timers for Distributed Systems
We deal with temporal aspects of distributed systems, introducing and studying a new model called timed distributed -calculus. This model extends distributed -calculus with timers...
Gabriel Ciobanu, Cristian Prisacariu