6393 search results - page 298 / 1279 » Randomized Algorithms on the Mesh |
160
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
174
click to vote
BIOWIRE
2007
Springer
16 years 25 days ago
2007
Springer
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. In particular, r...
189
click to vote
EMMCVPR
1999
Springer
15 years 11 months ago
1999
Springer
Markov Random Fields are widely used in many image processing applications. Recently the shortcomings of some of the simpler forms of these models have become apparent, and models ...
150
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
159
click to vote
CPC
2006
15 years 6 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...