Sciweavers

3055 search results - page 166 / 611
» Randomized Search Trees
Sort
View
125
Voted
AIRWEB
2007
Springer
15 years 6 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla
ICAISC
2004
Springer
15 years 6 months ago
An Evolutionary Algorithm for Oblique Decision Tree Induction
In the paper, a new evolutionary approach to induction of oblique decision trees is described. In each non-terminal node, the specialized evolutionary algorithm is applied to searc...
Marek Kretowski
104
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
VMV
2001
209views Visualization» more  VMV 2001»
15 years 2 months ago
A Novel Probabilistic Model for 3D Object Recognition: Spin-Glass Markov Random Fields
This contribution presents a new class of MRF, that is inspired by methods of statistical physics. The new energy function assumes full-connectivity in the neighborhood system and...
Barbara Caputo, Sahla Bouattour, Dietrich Paulus
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 7 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel