Sciweavers

2523 search results - page 283 / 505
» Objective: In Minimum Context
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...
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 10 months ago
A Unified Approach to Approximating Partial Covering Problems
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
Jochen Könemann, Ojas Parekh, Danny Segev
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
15 years 10 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev
CLUSTER
2001
IEEE
15 years 10 months ago
SOVIA: A User-level Sockets Layer Over Virtual Interface Architecture
The Virtual Interface Architecture (VIA) is an industry standard user-level communication architecture for system area networks. The VIA provides a protected, directlyaccessible i...
Jin-Soo Kim, Kangho Kim, Sung-In Jung
SGP
2004
15 years 9 months ago
Simplification and Improvement of Tetrahedral Models for Simulation
Most 3D mesh generation techniques require simplification and mesh improvement stages to prepare a tetrahedral model for efficient simulation. We have developed an algorithm that ...
Barbara Cutler, Julie Dorsey, Leonard McMillan