Sciweavers

234 search results - page 25 / 47
» Randomized splay trees: Theoretical and experimental results
Sort
View
UAI
2004
15 years 3 months ago
Blind Construction of Optimal Nonlinear Recursive Predictors for Discrete Sequences
We present a new method for nonlinear prediction of discrete random sequences under minimal structural assumptions. We give a mathematical construction for optimal predictors of s...
Cosma Rohilla Shalizi, Kristina Lisa Shalizi
SAT
2009
Springer
113views Hardware» more  SAT 2009»
15 years 8 months ago
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
Albert Atserias, Johannes Klaus Fichte, Marc Thurl...
NECO
2007
90views more  NECO 2007»
15 years 1 months ago
Neighborhood Property-Based Pattern Selection for Support Vector Machines
Support Vector Machine (SVM) has been spotlighted in the machine learning community thanks to its theoretical soundness and practical performance. When applied to a large data set...
Hyunjung Shin, Sungzoon Cho
124
Voted
FOCS
2008
IEEE
15 years 8 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
FOCS
1998
IEEE
15 years 6 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...