80 search results - page 11 / 16 » Data reduction and exact algorithms for clique cover |
ICWS
2004
IEEE
13 years 8 months ago
2004
IEEE
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
VLDB
2000
ACM
13 years 11 months ago
2000
ACM
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
MLDM
2008
Springer
13 years 7 months ago
2008
Springer
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
DOLAP
2004
ACM
14 years 25 days ago
2004
ACM
We address the inference control problem in data cubes with some data known to users through external knowledge. The goal of inference controls is to prevent exact values of sensi...