Sciweavers

1778 search results - page 310 / 356
» The Theory of Probabilistic Databases
Sort
View
ICDT
2010
ACM
137views Database» more  ICDT 2010»
14 years 9 months ago
A Greedy Algorithm for Constructing a Low-Width Generalized Hypertree Decomposition
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
Kaoru Katayama, Tatsuro Okawara, Yuka Itou
SIGSOFT
2010
ACM
14 years 7 months ago
The missing links: bugs and bug-fix commits
Empirical studies of software defects rely on links between bug databases and program code repositories. This linkage is typically based on bug-fixes identified in developer-enter...
Adrian Bachmann, Christian Bird, Foyzur Rahman, Pr...
IACR
2011
87views more  IACR 2011»
13 years 9 months ago
Is privacy compatible with truthfulness?
In the area of privacy-preserving data mining, a differentially private mechanism intuitively encourages people to share their data truthfully because they are at little risk of ...
David Xiao
PODS
2012
ACM
297views Database» more  PODS 2012»
13 years 12 days ago
Query-based data pricing
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
Paraschos Koutris, Prasang Upadhyaya, Magdalena Ba...
CVPR
2009
IEEE
1356views Computer Vision» more  CVPR 2009»
16 years 5 months ago
Average of Synthetic Exact Filters
This paper introduces a class of correlation filters called Average of Synthetic Exact Filters (ASEF). For ASEF, the correlation output is completely specified for each training ...
Bruce A. Draper, David S. Bolme, J. Ross Beveridge