ECAI
2010
Springer
13 years 9 months ago
2010
Springer
Many document collections are by nature dynamic, evolving as the topics or events they describe change. The goal of temporal text mining is to discover bursty patterns and to ident...
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
Conditional random fields (CRF) are widely used for predicting output variables that have some internal structure. Most of the CRF research has been done on structured classificati...
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We consider the problem of learning a user's ordinal preferences on a multiattribute domain, assuming that her preferences are lexicographic. We introduce a general ...
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
Ever since the seminal work of Searle, two components of interaction protocols have been identified: constitutive rules, defining the meaning of actions and regulative rules, defin...
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In this paper we tackle the problem of coordinating multiple decentralised agents with continuous state variables. Specifically we propose a hybrid approach, which combin...
CP
2010
Springer
13 years 9 months ago
2010
Springer
We present two heuristics based on constraint technology that solve the problem of generating air traffic management contingency plans, which are used in the case of a catastrophic...
CP
2010
Springer
13 years 9 months ago
2010
Springer
The automatic tuning of the parameters of algorithms and automatic selection of algorithms has received a lot of attention recently. One possible approach is the use of machine lea...
CP
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
CP
2010
Springer
13 years 9 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...