831 search results - page 95 / 167 » Finding Minimum Data Requirements Using Pseudo-independence |
SODA
2004
ACM
13 years 11 months ago
2004
ACM
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
ICDE
2010
IEEE
14 years 10 months ago
2010
IEEE
Monitoring global states of an application deployed over distributed nodes becomes prevalent in today's datacenters. State monitoring requires not only correct monitoring resu...
BMCBI
2010
13 years 10 months ago
2010
Background: Computational identification of blood-secretory proteins, especially proteins with differentially expressed genes in diseased tissues, can provide highly useful inform...
HPCA
2005
IEEE
14 years 10 months ago
2005
IEEE
The use of large instruction windows coupled with aggressive out-oforder and prefetching capabilities has provided significant improvements in processor performance. In this paper...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...