329 search results - page 30 / 66 » Uniform variable splitting |
SIAMCOMP
2002
14 years 11 months ago
2002
We consider sums of functions of subtrees of a random binary search tree, and obtain general laws of large numbers and central limit theorems. These sums correspond to random recur...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Let us assume that f is a continuous function defined on the unit ball of Rd , of the form f(x) = g(Ax), where A is a k×d matrix and g is a function of k variables for k ≪ d. ...
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
ICCAD
2007
IEEE
15 years 8 months ago
2007
IEEE
— In order to reduce parasitic mismatch in analog circuits, some groups of devices are required to share a common centroid while being placed. Devices are split into smaller ones...
ITNG
2008
IEEE
15 years 6 months ago
2008
IEEE
In our previous work, a Multi-Path Routing (MPR) scheme was proposed to maximize the data throughput for torus-based NoCs by utilizing multiple paths for concurrent data transmiss...