Sciweavers

569 search results - page 56 / 114
» An Empirical Study of Structural Constraint Solving Techniqu...
Sort
View
DAWAK
2006
Springer
15 years 10 months ago
Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
Jiuyong Li, Raymond Chi-Wing Wong, Ada Wai-Chee Fu...
INFOCOM
2012
IEEE
13 years 8 months ago
A simpler and better design of error estimating coding
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
Nan Hua, Ashwin Lall, Baochun Li, Jun Xu
ATAL
2009
Springer
16 years 26 days ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
16 years 13 days ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein
CORR
2012
Springer
232views Education» more  CORR 2012»
14 years 2 months ago
Smoothing Proximal Gradient Method for General Structured Sparse Learning
We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input...
Xi Chen, Qihang Lin, Seyoung Kim, Jaime G. Carbone...