1087 search results - page 23 / 218 » Generation under Space Constraints |
175
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
As XML-based messages have become common in many client-server protocols, there is a need to protect application servers from invalid or dangerous messages. This leads to the XML ...
137
click to vote
OL
2011
14 years 4 months ago
2011
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
105
click to vote
IJCAI
2001
15 years 3 months ago
2001
A tight integration of Mitchell's version space algorithm with Agrawal et al.'s Apriori algorithm is presented. The algorithm can be used to generate patterns that satis...
169
Voted
SIGMOD
2012
ACM
13 years 4 months ago
2012
ACM
We present BloomUnit, a testing framework for distributed programs written in the Bloom language. BloomUnit allows developers to write declarative test specifications that descri...
112
click to vote
APWEB
2004
Springer
15 years 7 months ago
2004
Springer
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...