549 search results - page 107 / 110 » On the Complexity of Restricted k-anonymity Problem |
165
click to vote
VRML
2000
ACM
15 years 10 months ago
2000
ACM
When distributing 3D contents real-time over a network with a narrow bandwidth such as a telephone line, methods for streaming and data compression can be considered indispensable...
147
click to vote
SIGMOD
1999
ACM
15 years 10 months ago
1999
ACM
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
165
click to vote
IGIS
1994
15 years 9 months ago
1994
There have been many interpolation methods developed over the years, each with their own problems. One of the biggest limitations in many applications is the non-correspondence of...
146
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
182
click to vote
CASC
2006
Springer
15 years 9 months ago
2006
Springer
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...