Sciweavers

126 search results - page 23 / 26
» Finding minimal bases in arbitrary spline spaces
Sort
View
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
15 years 4 months ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...
ZEUS
2010
153views Communications» more  ZEUS 2010»
14 years 11 months ago
Estimating costs of a service
When designing a publicly available Web service, a service designer has to take care of costs and revenue caused by this services. In the very beginning possible partners might onl...
Christian Gierds, Jan Sürmeli
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
14 years 11 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
DMDW
2000
93views Management» more  DMDW 2000»
14 years 11 months ago
Storing auxiliary data for efficient maintenance and lineage tracing of complex views
As views in a data warehouse become more complex, the view maintenance process can become very complicated and potentially very inefficient. Storing auxiliary views in the warehou...
Yingwei Cui, Jennifer Widom
AI
2000
Springer
14 years 9 months ago
EXPTIME tableaux for ALC
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r....
Francesco M. Donini, Fabio Massacci