Sciweavers

895 search results - page 123 / 179
» Dynamic Distributed Constraint Reasoning
Sort
View
DKE
2002
107views more  DKE 2002»
13 years 9 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
EDOC
2008
IEEE
14 years 4 months ago
Reliable Discovery and Selection of Composite Services in Mobile Environments
Service providers as we know them nowadays are the always-on “static” web service providers, that aim at Five9 availability (99.999%). Formal, or de-facto, standards, such as ...
Lucia Del Prete, Licia Capra
JLP
2011
155views more  JLP 2011»
13 years 4 months ago
QoS negotiation in service composition
Service composition in Service Oriented Computing concerns not only integration of heterogeneous distributed applications but also dynamic selection of services. Quality of Servic...
Maria Grazia Buscemi, Ugo Montanari
PODS
2008
ACM
174views Database» more  PODS 2008»
14 years 10 months ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...
SIAMCOMP
2012
12 years 10 days ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor