Sciweavers

10890 search results - page 1719 / 2178
» Automatic Complexity Analysis
Sort
View
IPPS
2005
IEEE
16 years 12 days ago
Characterizing Secure Dynamic Web Applications Scalability
Security in the access to web contents and the interaction with web sites is becoming one of the most important issues in Internet. Servers need to provide certain levels of secur...
Jordi Guitart, Vicenç Beltran, David Carrer...
DEXA
2005
Springer
148views Database» more  DEXA 2005»
16 years 10 days ago
XG: A Data-Driven Computation Grid for Enterprise-Scale Mining
In this paper we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. We show how such an architecture can be le...
Radu Sion, Ramesh Natarajan, Inderpal Narang, Wen-...
PLDI
2004
ACM
16 years 7 days ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....
TACAS
2004
Springer
122views Algorithms» more  TACAS 2004»
16 years 4 days ago
A Scalable Incomplete Test for the Boundedness of UML RT Models
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
Stefan Leue, Richard Mayr, Wei Wei
PODS
2010
ACM
306views Database» more  PODS 2010»
15 years 12 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...
« Prev « First page 1719 / 2178 Last » Next »