Sciweavers

1434 search results - page 85 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 8 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
WWW
2005
ACM
14 years 8 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
14 years 1 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
ACSAC
2010
IEEE
13 years 5 months ago
Fast and practical instruction-set randomization for commodity systems
Instruction-set randomization (ISR) is a technique based on randomizing the "language" understood by a system to protect it from code-injection attacks. Such attacks wer...
Georgios Portokalidis, Angelos D. Keromytis
BMCBI
2007
157views more  BMCBI 2007»
13 years 7 months ago
Constructing gene co-expression networks and predicting functions of unknown genes by random matrix theory
Background: Large-scale sequencing of entire genomes has ushered in a new age in biology. One of the next grand challenges is to dissect the cellular networks consisting of many i...
Feng Luo, Yunfeng Yang, Jianxin Zhong, Haichun Gao...