Sciweavers

270 search results - page 41 / 54
» Dynamic Complexity Theory Revisited
Sort
View
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
16 years 6 days ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
PODS
2008
ACM
110views Database» more  PODS 2008»
15 years 12 months ago
Static analysis of active XML systems
Active XML is a high-level specification language tailored to dataintensive, distributed, dynamic Web services. Active XML is based on XML documents with embedded function calls. ...
Serge Abiteboul, Luc Segoufin, Victor Vianu
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 6 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
CDC
2008
IEEE
103views Control Systems» more  CDC 2008»
15 years 6 months ago
Symbolic models for nonlinear control systems affected by disturbances
Abstract— Symbolic models are abstract descriptions of continuous systems in which symbols represent aggregates of continuous states. In the last few years there has been a growi...
Giordano Pola, Paulo Tabuada
HICSS
2006
IEEE
144views Biometrics» more  HICSS 2006»
15 years 5 months ago
Habermasian Inquiring System: Toward a General Framework for Knowledge Management Research
This study addresses a long-standing and wellrecognized problem in KM research, namely the lack of conceptual integration and a cumulative tradition. Knowledge management needs an...
Zining Guo, James Sheffield