2354 search results - page 354 / 471 » Randomness, Stochasticity and Approximations |
258
click to vote
ICDT
2009
ACM
16 years 6 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
157
click to vote
PLDI
2006
ACM
15 years 12 months ago
2006
ACM
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...
191
click to vote
SAC
2003
ACM
15 years 11 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
170
click to vote
SIGECOM
2010
ACM
15 years 10 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
158
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Theme-driven cancer survival studies address whether the expression signature of genes related to a biological process can predict patient survival time. Although this...