Sciweavers

735 search results - page 28 / 147
» Randomization in Parallel Stringology
Sort
View
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
13 years 4 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh
FTDCS
2004
IEEE
15 years 5 months ago
Random Landmarking in Mobile, Topology-Aware Peer-to-Peer Networks
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
Rolf Winter, Thomas Zahn, Jochen H. Schiller
FUIN
2008
93views more  FUIN 2008»
15 years 1 months ago
An Algebraic Framework for Defining Random Concurrent Behaviours
Abstract. The paper is devoted to characterizing systems with random behaviours. The characterization is based on considering systems in terms of their possible runs, called proces...
Józef Winkowski
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
15 years 5 months ago
Derandomized Parallel Repetition Theorems for Free Games
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
Ronen Shaltiel
IPPS
1999
IEEE
15 years 6 months ago
A Formal Definition of the Phenomenon of Collective Intelligence and its IQ Measure
This paper formalizes the concept of Collective Intelligence (C-I). Application of the Random PROLOG Processor (RPP) has allowed us to model the phenomenon of C-I in social structu...
Tadeusz Szuba