2976 search results - page 340 / 596 » On the bounded integer programming |
134
Voted
WCET
2010
15 years 2 months ago
2010
Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictability of cache performance introduc...
163
click to vote
JMLR
2012
13 years 7 months ago
2012
We show that the stick-breaking construction of the beta process due to Paisley et al. (2010) can be obtained from the characterization of the beta process as a Poisson process. S...
237
click to vote
ICDE
2005
IEEE
16 years 6 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
122
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
124
click to vote
PODS
2001
ACM
16 years 4 months ago
2001
ACM
The paper investigates XML document speci cations with DTDs and integrity constraints, such as keysand foreign keys. We study the consistency problem of checking whether a given s...