Sciweavers

1279 search results - page 160 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
EDBT
2008
ACM
135views Database» more  EDBT 2008»
14 years 9 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo
COLT
2007
Springer
14 years 3 months ago
Learning Large-Alphabet and Analog Circuits with Value Injection Queries
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin
WWW
2005
ACM
14 years 9 months ago
Automated semantic web services orchestration via concept covering
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
VLDB
2011
ACM
276views Database» more  VLDB 2011»
13 years 3 months ago
Ranking queries on uncertain data
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Xuemin Lin
KDD
2003
ACM
269views Data Mining» more  KDD 2003»
14 years 9 months ago
Maximizing the spread of influence through a social network
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
David Kempe, Jon M. Kleinberg, Éva Tardos