5138 search results - page 324 / 1028 » Randomized Algorithms for 3-SAT |
191
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
184
click to vote
SIGGRAPH
1989
ACM
15 years 10 months ago
1989
ACM
A solid noise is a function that defines a random value at each point in space. Solid noises have immediate and powerful applications in surface texturing, stochastic modeling, a...
141
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
164
click to vote
WEA
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
171
click to vote
ICSEA
2007
IEEE
16 years 29 days ago
2007
IEEE
— This paper demonstrates that the algorithmic performance of end user programs may be greatly affected by the two or three level caching scheme of the processor, and we introduc...