Sciweavers

1846 search results - page 176 / 370
» Generating query substitutions
Sort
View
COMPGEOM
2005
ACM
13 years 10 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
DKE
2006
94views more  DKE 2006»
13 years 8 months ago
Extending the data warehouse for service provisioning data
The last few years, there has been an extensive body of literature in data warehousing applications that primarily focuses on basket-type (transactional) data, common in retail in...
Yannis Kotidis
FOCS
2010
IEEE
13 years 6 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan
SDMW
2004
Springer
14 years 1 months ago
Using Secret Sharing for Searching in Encrypted Data
When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the...
Richard Brinkman, Jeroen Doumen, Willem Jonker
ADBIS
2010
Springer
136views Database» more  ADBIS 2010»
13 years 9 months ago
New Frontiers in Business Intelligence: Distribution and Personalization
Abstract. To meet the new, more sophisticated needs of decision makers, a new generation of BI systems is emerging. In this paper we focus on two enabling technologies for this new...
Stefano Rizzi