1369 search results - page 57 / 274 » Lattice computations for random numbers |
DMSN
2004
ACM
14 years 2 months ago
2004
ACM
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
BMCBI
2007
13 years 9 months ago
2007
Variable importance measures for random forests have been receiving increased attention as a means of variable selection in many classification tasks in bioinformatics and relate...
SPAA
2009
ACM
14 years 6 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
COLT
2003
Springer
14 years 2 months ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...