Sciweavers

9509 search results - page 1818 / 1902
» Complex Event Processing
Sort
View
132
Voted
PODS
2010
ACM
306views Database» more  PODS 2010»
15 years 5 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...
GLVLSI
2002
IEEE
108views VLSI» more  GLVLSI 2002»
15 years 5 months ago
Protected IP-core test generation
Design simplification is becoming necessary to respect the target time-to-market of SoCs, and this goal can be obtained by using predesigned IP-cores. However, their correct inte...
Alessandro Fin, Franco Fummi
130
Voted
MICRO
2002
IEEE
143views Hardware» more  MICRO 2002»
15 years 5 months ago
Effective instruction scheduling techniques for an interleaved cache clustered VLIW processor
Clustering is a common technique to overcome the wire delay problem incurred by the evolution of technology. Fully-distributed architectures, where the register file, the functio...
Enric Gibert, F. Jesús Sánchez, Anto...
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 5 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
110
Voted
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
15 years 5 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
« Prev « First page 1818 / 1902 Last » Next »