Sciweavers

4908 search results - page 200 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
INFOCOM
2000
IEEE
15 years 11 months ago
Optimal Partition of QoS requirements with Discrete Cost Functions
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
Danny Raz, Yuval Shavitt
DATE
1998
IEEE
141views Hardware» more  DATE 1998»
15 years 10 months ago
Address Bus Encoding Techniques for System-Level Power Optimization
The power dissipated by system-level buses is the largest contribution to the global power of complex VLSI circuits. Therefore, the minimization of the switching activity at the I...
Luca Benini, Giovanni De Micheli, Donatella Sciuto...
ADBIS
1998
Springer
100views Database» more  ADBIS 1998»
15 years 10 months ago
Multiple Range Query Optimization in Spatial Databases
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
Apostolos Papadopoulos, Yannis Manolopoulos
DEBS
2007
ACM
15 years 10 months ago
Temporal order optimizations of incremental joins for composite event detection
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
François Bry, Michael Eckert
ETRICS
2006
15 years 10 months ago
Optimized Workflow Authorization in Service Oriented Architectures
Abstract. Complex business processes are usually realized by specifying the integration and interaction of smaller modular software components. For example, hitherto monolithic ent...
Martin Wimmer, Martina-Cezara Albutiu, Alfons Kemp...