Sciweavers

3055 search results - page 343 / 611
» Randomized Search Trees
Sort
View
146
Voted
SIGIR
2006
ACM
15 years 9 months ago
Finding near-duplicate web pages: a large-scale evaluation of algorithms
Broder et al.’s [3] shingling algorithm and Charikar’s [4] random projection based approach are considered “state-of-theart” algorithms for finding near-duplicate web pag...
Monika Rauch Henzinger
GI
2004
Springer
15 years 9 months ago
Outlier Detection by Rareness Assumption
: A concept for identification of candidates for outliers is presented, with a focus on nominal variables. The database concerned is searched for rules that are almost universally...
Tomas Hrycej, Jochen Hipp
104
Voted
ECML
2006
Springer
15 years 7 months ago
Why Is Rule Learning Optimistic and How to Correct It
Abstract. In their search through a huge space of possible hypotheses, rule induction algorithms compare estimations of qualities of a large number of rules to find the one that ap...
Martin Mozina, Janez Demsar, Jure Zabkar, Ivan Bra...
104
Voted
DRM
2007
Springer
15 years 9 months ago
Data structures for limited oblivious execution of programs while preserving locality of reference
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
Avinash V. Varadarajan, Ramarathnam Venkatesan, C....
130
Voted
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
15 years 7 months ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Josep Díaz, Jordi Petit, Panagiotis Psychar...