Sciweavers

1095 search results - page 104 / 219
» Preprocessing of Intractable Problems
Sort
View
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 10 months ago
Mining all frequent projection-selection queries from a relational table
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos
EDBTW
2010
Springer
14 years 5 months ago
Updating probabilistic XML
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
Evgeny Kharlamov, Werner Nutt, Pierre Senellart
RTCSA
2009
IEEE
14 years 5 months ago
Multi-path Planning for Mobile Element to Prolong the Lifetime of Wireless Sensor Networks
Mobile elements, which can traverse the deployment area and convey the observed data from static sensor nodes to a base station, have been introduced for energy efficient data co...
Dakai Zhu, Yifeng Guo, Ali Saman Tosun
IDA
2009
Springer
14 years 4 months ago
Canonical Dual Approach to Binary Factor Analysis
Abstract. Binary Factor Analysis (BFA) is a typical problem of Independent Component Analysis (ICA) where the signal sources are binary. Parameter learning and model selection in B...
Ke Sun, Shikui Tu, David Yang Gao, Lei Xu
KSEM
2009
Springer
14 years 4 months ago
An Anytime Algorithm for Computing Inconsistency Measurement
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...