2218 search results - page 301 / 444 » Testing Expressibility Is Hard |
POPL
2003
ACM
14 years 9 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
VLDB
2007
ACM
14 years 9 months ago
2007
ACM
The networked and increasingly ubiquitous nature of today's data management services mandates assurances to detect and deter malicious or faulty behavior. This is particularly...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are g...