Sciweavers

4276 search results - page 230 / 856
» Computability of Probability Distributions and Distribution ...
Sort
View
PDPTA
2003
15 years 6 months ago
Managing Flocking Objects with an Octree Spanning a Parallel Message-Passing Computer Cluster
We investigate the management of flocking mobile objects using a parallel message-passing computer cluster. An octree, a data structure well-known for use in managing a 3D space, ...
Thomas E. Portegys, Kevin M. Greenan
137
Voted
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 6 months ago
Learning Random Monotone DNF
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedi...
WWW
2010
ACM
15 years 11 months ago
Tracking the random surfer: empirically measured teleportation parameters in PageRank
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
David F. Gleich, Paul G. Constantine, Abraham D. F...
BMCBI
2007
129views more  BMCBI 2007»
15 years 4 months ago
Algebraic correction methods for computational assessment of clone overlaps in DNA fingerprint mapping
Background: The Sulston score is a well-established, though approximate metric for probabilistically evaluating postulated clone overlaps in DNA fingerprint mapping. It is known t...
Michael C. Wendl
EUROPAR
2009
Springer
15 years 9 months ago
Modeling Resubmission in Unreliable Grids: The Bottom-Up Approach
Abstract. Failure is an ordinary characteristic of large-scale distributed environments. Resubmission is a general strategy employed to cope with failures in grids. Here, we analyt...
Vandy Berten, Emmanuel Jeannot