Sciweavers

2523 search results - page 227 / 505
» Objective: In Minimum Context
Sort
View
CIKM
2009
Springer
16 years 1 days ago
POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice
Data generalization is widely used to protect identities and prevent inference of sensitive information during the public release of microdata. The k-anonymity model has been exte...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
EMSOFT
2004
Springer
15 years 11 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
ADHOC
2007
139views more  ADHOC 2007»
15 years 5 months ago
Bounded-distance multi-clusterhead formation in wireless ad hoc networks
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
Marco Aurélio Spohn, J. J. Garcia-Luna-Acev...
TON
2002
99views more  TON 2002»
15 years 5 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
CORR
2010
Springer
219views Education» more  CORR 2010»
15 years 3 months ago
Cooperative Algorithms for MIMO Interference Channels
Interference alignment is a transmission technique for exploiting all available degrees of freedom in the symmetric frequency- or time-selective interference channel with an arbit...
Steven W. Peters, Robert W. Heath Jr.