Sciweavers

848 search results - page 75 / 170
» Randomness and the linear degrees of computability
Sort
View
MASCOTS
2001
15 years 1 months ago
Large-Scale Simulation of Replica Placement Algorithms for a Serverless Distributed File System
Farsite is a scalable, distributed file system that logically functions as a centralized file server but that is physically implemented on a set of client desktop computers. Farsi...
John R. Douceur, Roger Wattenhofer
NETWORKS
2008
14 years 11 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
NN
2000
Springer
177views Neural Networks» more  NN 2000»
14 years 11 months ago
Independent component analysis: algorithms and applications
A fundamental problem in neural network research, as well as in many other disciplines, is finding a suitable representation of multivariate data, i.e. random vectors. For reasons...
Aapo Hyvärinen, Erkki Oja
BROADNETS
2007
IEEE
15 years 6 months ago
DIMPLE: DynamIc Membership ProtocoL for epidemic protocols
—Epidemic protocols assume that information of a random set of nodes is provided at each protocol round. By definition, the random set needs to be chosen uniformly and randomly ...
Jin Sun, Paul J. Weber, Byung Kyu Choi, Roger M. K...
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
13 years 2 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...