536 search results - page 76 / 108 » The hardness and approximation algorithms for l-diversity |
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
COCOA
2009
Springer
14 years 2 months ago
2009
Springer
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
SIGECOM
2003
ACM
14 years 1 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...