Sciweavers

124 search results - page 11 / 25
» Randomly supported independence and resistance
Sort
View
AUSAI
2007
Springer
14 years 1 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
DSN
2007
IEEE
14 years 1 months ago
Electing an Eventual Leader in an Asynchronous Shared Memory System
This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in messagepassing syste...
Antonio Fernández, Ernesto Jiménez, ...
CCS
2006
ACM
13 years 11 months ago
Secure hierarchical in-network aggregation in sensor networks
In-network aggregation is an essential primitive for performing queries on sensor network data. However, most aggregation algorithms assume that all intermediate nodes are trusted...
Haowen Chan, Adrian Perrig, Dawn Xiaodong Song
TOMACS
2011
139views more  TOMACS 2011»
13 years 2 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
13 years 11 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo