Sciweavers

2526 search results - page 17 / 506
» A New Algorithm for Answer Set Computation
Sort
View
CVPR
2004
IEEE
14 years 11 months ago
A New GPCA Algorithm for Clustering Subspaces by Fitting, Differentiating and Dividing Polynomials
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
Jacopo Piazzi, René Vidal, Yi Ma
DATAMINE
2006
127views more  DATAMINE 2006»
13 years 9 months ago
Computing LTS Regression for Large Data Sets
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
Peter Rousseeuw, Katrien van Driessen
PODS
2010
ACM
306views Database» more  PODS 2010»
14 years 2 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...
ACL
2009
13 years 7 months ago
Opinion and Generic Question Answering Systems: a Performance Analysis
The importance of the new textual genres such as blogs or forum entries is growing in parallel with the evolution of the Social Web. This paper presents two corpora of blog posts ...
Alexandra Balahur, Ester Boldrini, Andrés M...
PODS
2003
ACM
114views Database» more  PODS 2003»
14 years 9 months ago
Soft stratification for magic set based query evaluation in deductive databases
In this paper we propose a new bottom-up query evaluation method for stratified deductive databases based on the Magic Set approach. As the Magic Sets rewriting may lead to unstra...
Andreas Behrend