Sciweavers

1207 search results - page 238 / 242
» Towards optimal k-anonymization
Sort
View
ADHOC
2006
97views more  ADHOC 2006»
13 years 8 months ago
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...
IJCSA
2008
108views more  IJCSA 2008»
13 years 8 months ago
Consistency Check Algorithms for Multi-Dimensional Preference Trade-Offs
: Skyline Queries have recently received a lot of attention due to their intuitive query capabilities. Following the concept of Pareto optimality all `best' database objects a...
Christoph Lofi, Wolf-Tilo Balke, Ulrich Güntz...
BMCBI
2007
107views more  BMCBI 2007»
13 years 8 months ago
Linking microarray reporters with protein functions
Background: The analysis of microarray experiments requires accurate and up-to-date functional annotation of the microarray reporters to optimize the interpretation of the biologi...
Stan Gaj, Arie van Erk, Rachel I. M. van Haaften, ...
CORR
2007
Springer
167views Education» more  CORR 2007»
13 years 8 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula
JNCA
2008
86views more  JNCA 2008»
13 years 8 months ago
Performance comparisons of load balancing algorithms for I/O-intensive workloads on clusters
Load balancing techniques play a critically important role in developing high-performance cluster computing platforms. Existing load balancing approaches are concerned with the ef...
Xiao Qin