Sciweavers

1937 search results - page 369 / 388
» Conditioning Probabilistic Databases
Sort
View
ICDE
2008
IEEE
123views Database» more  ICDE 2008»
15 years 11 months ago
Handling Non-linear Polynomial Queries over Dynamic Data
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
Shetal Shah, Krithi Ramamritham
ICDT
2009
ACM
149views Database» more  ICDT 2009»
15 years 10 months ago
Query languages for data exchange: beyond unions of conjunctive queries
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
Juan Reutter, Marcelo Arenas, Pablo Barceló
ICDT
2009
ACM
143views Database» more  ICDT 2009»
15 years 10 months ago
Automatic construction of simple artifact-based business processes
Almost all medium- and large-scale businesses rely on electronic workflow systems to manage their business processes. A key challenge is to enable the easy re-use and modification...
Christian Fritz, Richard Hull, Jianwen Su
KDD
2009
ACM
194views Data Mining» more  KDD 2009»
15 years 10 months ago
Combining link and content for community detection: a discriminative approach
In this paper, we consider the problem of combining link and content analysis for community detection from networked data, such as paper citation networks and Word Wide Web. Most ...
Tianbao Yang, Rong Jin, Yun Chi, Shenghuo Zhu
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
15 years 10 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...