Sciweavers

2035 search results - page 231 / 407
» On the complexity of stratified logics
Sort
View
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
15 years 4 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
IJAOSE
2010
126views more  IJAOSE 2010»
15 years 3 months ago
Automated analysis of compositional multi-agent systems
An approach for handling the complex dynamics of a multi-agent system is based on distinguishing aggregation levels. The behaviour at a given aggregation level is specified by a se...
Alexei Sharpanskykh, Jan Treur
ICCSA
2011
Springer
14 years 10 months ago
Standardization of Game Based Learning Design
The standardization of the design of learning games is a contradictory topic: The existence of a rich variety of domains and applications is in conflict with the desire for unifica...
Sebastian Kelle, Roland Klemke, Marion R. Gruber, ...
IS
2012
14 years 2 months ago
View determinacy for preserving selected information in data transformations
When transforming data one often wants certain information in the data source to be preserved, i.e., we identify parts of the source data and require these parts to be transformed...
Wenfei Fan, Floris Geerts, Lixiao Zheng
PLDI
2012
ACM
13 years 9 months ago
Scalable and precise dynamic datarace detection for structured parallelism
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...