Sciweavers

1464 search results - page 114 / 293
» On optimal anonymization for l -diversity
Sort
View
ICDM
2009
IEEE
149views Data Mining» more  ICDM 2009»
16 years 1 months ago
Accelerated Gradient Method for Multi-task Sparse Learning Problem
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
Xi Chen, Weike Pan, James T. Kwok, Jaime G. Carbon...
TC
2011
15 years 1 months ago
Maximizing Spare Utilization by Virtually Reorganizing Faulty Cache Lines
—Aggressive technology scaling to 45nm and below introduces serious reliability challenges to the design of microprocessors. Since a large fraction of chip area is devoted to on-...
Amin Ansari, Shantanu Gupta, Shuguang Feng, Scott ...
CVPR
2009
IEEE
17 years 1 months ago
Half-integrality based algorithms for Cosegmentation of Images
We study the cosegmentation problem where the objective is to segment the same object (i.e., region) from a pair of images. The segmentation for each image can be cast using a p...
Chuck R. Dyer, Lopamudra Mukherjee, Vikas Singh
ICIP
2006
IEEE
16 years 8 months ago
Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation
We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the image segmentation problem. DEE combines aspects of...
Mala L. Radhakrishnan, Sara L. Su
ICIP
1997
IEEE
16 years 8 months ago
Complexity-Regularized Image Denoising
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...
Juan Liu, Pierre Moulin