8 search results - page 1 / 2 » A Uniform Lower Bound on Weights of Perceptrons |
CSR
2008
Springer
13 years 12 months ago
2008
Springer
STOC
1995
ACM
14 years 2 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
SAT
2005
Springer
14 years 4 months ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarante...
CPC
2007
13 years 10 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...