2944 search results - page 225 / 589 » Improving Bound Propagation |
199
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
200
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
193
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
180
click to vote
BROADNETS
2006
IEEE
16 years 19 days ago
2006
IEEE
Existing slotted channel access schemes in wireless networks assume that slot boundaries at all nodes are synchronized. In practice, relative clock drifts among nodes cause slot mi...
187
click to vote
LPAR
2001
Springer
15 years 11 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...