5138 search results - page 183 / 1028 » Randomized Algorithms for 3-SAT |
169
click to vote
CAEPIA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
163
click to vote
NIPS
2007
15 years 7 months ago
2007
To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and then apply existing fast linear methods. The feat...
160
click to vote
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
We propose the use of random projections with a sparse matrix to maintain a sketch of a collection of high-dimensional data-streams that are updated asynchronously. This sketch al...
160
click to vote
CSDA
2007
15 years 6 months ago
2007
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
143
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...