158 search results - page 13 / 32 » Depth as Randomness Deficiency |
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We consider boolean circuits computing n-operators f : {0, 1}n {0, 1}n . As gates we allow arbitrary boolean functions; neither fanin nor fanout of gates is restricted. An operat...
97
Voted
AUSDM
2006
Springer
15 years 5 months ago
2006
Springer
If the dataset available to machine learning results from cluster sampling (e.g. patients from a sample of hospital wards), the usual cross-validation error rate estimate can lead...
114
click to vote
SPAA
2009
ACM
15 years 11 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...
101
click to vote
CP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Much progress has been made in terms of boosting the effectiveness of backtrack style search methods. In addition, during the last decade, a much better understanding of ...
99
Voted
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...