Sciweavers

1791 search results - page 289 / 359
» Semantics and Complexity of SPARQL
Sort
View
CIDM
2007
IEEE
15 years 8 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
DEBS
2007
ACM
15 years 8 months ago
Towards a common API for publish/subscribe
Over the last decade a wide range of publish/subscribe (pub/ sub) systems have come out of the research community. However, there is little consensus on a common pub/sub API, whic...
Peter R. Pietzuch, David M. Eyers, Samuel Kounev, ...
ER
2007
Springer
167views Database» more  ER 2007»
15 years 8 months ago
An Unified Dynamic Description Logic Model for Databases: Relational Data, Relational Operations and Queries
The paper presents an unified Description Logic (DL) model for databases. Describing database models using DLs is a fundamental problem in many areas because it turns databases to...
Guoshun Hao, Shilong Ma, Yuefei Sui, Jianghua Lv
162
Voted
ASWSD
2006
Springer
15 years 7 months ago
Generating Sound and Resource-Aware Code from Hybrid Systems Models
Modern real-time embedded systems are complex, distributed, feature-rich applications. Model-based development of real-time embedded systems promises to simplify and accelerate the...
Madhukar Anand, Sebastian Fischmeister, Jesung Kim...
142
Voted
ATVA
2006
Springer
112views Hardware» more  ATVA 2006»
15 years 7 months ago
Synthesis for Probabilistic Environments
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
Sven Schewe