536 search results - page 93 / 108 » The hardness and approximation algorithms for l-diversity |
109
click to vote
IWLCS
2005
Springer
15 years 3 months ago
2005
Springer
Aiming to clarify the convergence or divergence conditions for Learning Classifier System (LCS), this paper explores: (1) an extreme condition where the reinforcement process of ...
102
click to vote
OOPSLA
2005
Springer
15 years 3 months ago
2005
Springer
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
ATAL
2003
Springer
15 years 2 months ago
2003
Springer
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
146
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...