Sciweavers

4908 search results - page 32 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
STACS
2010
Springer
15 years 9 months ago
Optimal Query Complexity for Reconstructing Hypergraphs
In this paper we consider the problem of reconstructing a hidden weighted hypergraph of constant rank using additive queries. We prove the following: Let G be a weighted hidden h...
Nader H. Bshouty, Hanna Mazzawi
ICDE
2008
IEEE
184views Database» more  ICDE 2008»
15 years 8 months ago
Optimizing Complex Event Processing over RFID Data Streams
Qun Chen, Zhanhuai Li, Hailong Liu
ICEIS
2008
IEEE
15 years 8 months ago
Model-Driven Generation and Optimization of Complex Integration Processes
Matthias Böhm, Uwe Wloka, Dirk Habich, Wolfga...
VTC
2007
IEEE
15 years 8 months ago
Optimized Signal Acquisition for Low-Complexity and Low-Power IR-UWB Transceivers
Claude Desset, Mustafa Badaroglu, Julien Ryckaert,...