Sciweavers

5138 search results - page 25 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
ECCC
2010
108views more  ECCC 2010»
13 years 7 months ago
Improved bounds for the randomized decision tree complexity of recursive majority
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
Frédéric Magniez, Ashwin Nayak, Mikl...
PR
2011
13 years 18 days ago
Content-based image retrieval with relevance feedback using random walks
In this paper we propose a novel approach to content-based image retrieval with relevance feedback, which is based on the random walker algorithm introduced in the context of inte...
Samuel Rota Bulò, Massimo Rabbi, Marcello P...
EMNLP
2009
13 years 7 months ago
On the Use of Virtual Evidence in Conditional Random Fields
Virtual evidence (VE), first introduced by (Pearl, 1988), provides a convenient way of incorporating prior knowledge into Bayesian networks. This work generalizes the use of VE to...
Xiao Li
CORR
2012
Springer
171views Education» more  CORR 2012»
12 years 5 months ago
Random Feature Maps for Dot Product Kernels
Approximating non-linear kernels using feature maps has gained a lot of interest in recent years due to applications in reducing training and testing times of SVM classifiers and...
Purushottam Kar, Harish Karnick
RANDOM
1999
Springer
14 years 2 months ago
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
Seth Pettie, Vijaya Ramachandran