Sciweavers

1464 search results - page 207 / 293
» On optimal anonymization for l -diversity
Sort
View
ICIP
2001
IEEE
16 years 8 months ago
Color error diffusion with generalized optimum noise shaping
Wc optimizc thc noisc shaping bchavior of color crror diffusion by designing an optirnizcd crror filtcr bascd on a proposed noisc shaping modcl for color crror diffusion and a gcn...
Niranjan Damera-Venkata, Brian L. Evans
PPOPP
2009
ACM
16 years 7 months ago
A compiler-directed data prefetching scheme for chip multiprocessors
Data prefetching has been widely used in the past as a technique for hiding memory access latencies. However, data prefetching in multi-threaded applications running on chip multi...
Dhruva Chakrabarti, Mahmut T. Kandemir, Mustafa Ka...
STOC
2004
ACM
145views Algorithms» more  STOC 2004»
16 years 6 months ago
Using mixture models for collaborative filtering
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
Jon M. Kleinberg, Mark Sandler
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
16 years 6 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
FOCS
2009
IEEE
16 years 1 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi